# 递归
def fibonacci(n):
if n == 1:
return 2
elif n == 2:
return 3
else:
return fibonacci(n - 1) + fibonacci(n - 2)
x = int(input())
print(fibonacci(x))

# 递归
def fibonacci(n):
if n == 1:
return 2
elif n == 2:
return 3
else:
return fibonacci(n - 1) + fibonacci(n - 2)
x = int(input())
print(fibonacci(x))