PROGRAMMING:Output the first n Fibonacci numbers
This problem requires the preparation of procedures, output Fibonacci (Fibonacci) sequence of the first $$n $$items, each line output 5, the title to ensure that the output results in the long integer range. Fibonacci sequence is a sequence which satisfies that any number is the sum of the first two terms (the first two terms are defined as 1), for example: 1, 1, 2, 3, 5, 8, 13.
###Input format:
Input gives an integer $$n $$($$1 / Le n / Le 46 $$) in one line.
###Output format:
Output the first $$n $$Fibonacci numbers, each number occupies 11 bits, and each line outputs 5. If the output number of the last line is less than 5, you also need to wrap the line.
If $$n $$is less than '1', output '` invalid.'
###Input sample 1:
```in
seven
```
###Output sample 1:
```out
1 1 2 3 5
8 13
```
###Input example 2:
```
0
```
###Output example 2:
```
Invalid.
```
answer：If there is no answer, please comment
###Input format:
Input gives an integer $$n $$($$1 / Le n / Le 46 $$) in one line.
###Output format:
Output the first $$n $$Fibonacci numbers, each number occupies 11 bits, and each line outputs 5. If the output number of the last line is less than 5, you also need to wrap the line.
If $$n $$is less than '1', output '` invalid.'
###Input sample 1:
```in
seven
```
###Output sample 1:
```out
1 1 2 3 5
8 13
```
###Input example 2:
```
0
```
###Output example 2:
```
Invalid.
```
answer：If there is no answer, please comment