The penultimate task involved the calculation of the typical Fibonacci sequence up to the nth term.

Input – single integer n

Output – Fibonacci sequence up to the nth term, all terms on a new line

SAMPLE INPUT
5

SAMPLE OUTPUT
1
1
2
3
5
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'
#cout << fixed << setprecision(0) << fmod(((pow(1.6180339,i)-(pow(-0.6180339,i))) / 2.236067977) , pow(10,9)+7)  << endl

n = int(raw_input())
i = 1
while (i <= n):
	print  int(  round(  ((pow(1.6180339,i)-(pow(-0.6180339,i))) / 2.236067977) % (pow(10,9)+7)  )  )
	i = i + 1