Prime Number Pattern

You are given an integer N. Your task is to print a pattern of size N such that the i^th line (for \( 1 \le i \le N \)) contains the first i prime numbers, separated by a single space. For example, if N=3, the output should be:

2
2 3
2 3 5

Please note that the value of N is restricted to the range \(1 \le N \le 5\). If an input outside this range is provided, your program should raise an error.

inputFormat

The input consists of a single integer N (where \(1 \le N \le 5\)) from standard input. This integer represents the number of rows in the pattern.

outputFormat

The output is the desired pattern printed to standard output. The i^th line contains the first i prime numbers, separated by a space.

## sample

1

2

</p>