def Fio(n):
if n <= 1:
return n
else:
a, b, c = 0, 1, 0
for i in range(n-1):
c = a + b
a = b
b = c
return c
n = int(input())
print(Fio(n))
def Fio(n):
if n <= 1:
return n
else:
a, b, c = 0, 1, 0
for i in range(n-1):
c = a + b
a = b
b = c
return c
n = int(input())
print(Fio(n))