def Fibonacci(n):
	if n <= 0:
		return 0
	if n <= 1:
		return n
	f0 = 0; f1 = 1
	for i in range(2, n + 1):
		fn = f0 + f1
		f0 = f1
		f1 = fn
	return fn