def fibonacci(N, dp):
    if dp[N] != 0:
        return dp[N]
    if N == 1 or N == 0:
        dp[N] = 1
    else:
        dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp)
    return dp[N]


def main():
    N = int(input())
    dp = [0] * (N + 1)
    print(fibonacci(N, dp))


if __name__ == '__main__':
    main()
 def fibonacci(N, dp):
    if dp[N] != 0:
        return dp[N]
    if N == 1 or N == 0:
        dp[N] = 1
    else:
        dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp)
    return dp[N] fibonacci if dp[N] != 0:
        return dp[N]
     dp[N] != 0 dp[N] dp N 0 return dp[N] dp[N] dp N if N == 1 or N == 0:
        dp[N] = 1
    else:
        dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp)
     N == 1 or N == 0 N == 1 N 1 N == 0 N 0 dp[N] = 1 dp[N] dp N 1 dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp) dp[N] dp N fibonacci(N - 1, dp) + fibonacci(N - 2, dp) fibonacci(N - 1, dp) fibonacci N - 1 N 1 dp fibonacci(N - 2, dp) fibonacci N - 2 N 2 dp return dp[N] dp[N] dp N N N dp dp def main():
    N = int(input())
    dp = [0] * (N + 1)
    print(fibonacci(N, dp)) main N = int(input()) N int(input()) int input() input dp = [0] * (N + 1) dp [0] * (N + 1) [0] 0 N + 1 N 1 print(fibonacci(N, dp)) print fibonacci(N, dp) fibonacci N dp if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def main():
    N = int(input())
    dp = [0] * (N + 1)
    print(fibonacci(N, dp)) def main():
    N = int(input())
    dp = [0] * (N + 1)
    print(fibonacci(N, dp)) main def fibonacci(N, dp):
    if dp[N] != 0:
        return dp[N]
    if N == 1 or N == 0:
        dp[N] = 1
    else:
        dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp)
    return dp[N] def fibonacci(N, dp):
    if dp[N] != 0:
        return dp[N]
    if N == 1 or N == 0:
        dp[N] = 1
    else:
        dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp)
    return dp[N] fibonacci
def fibonacci(N, dp):
    if dp[N] != 0:
        return dp[N]
    if N == 1 or N == 0:
        dp[N] = 1
    else:
        dp[N] = fibonacci(N - 1, dp) + fibonacci(N - 2, dp)
    return dp[N]


def main():
    N = int(input())
    dp = [0] * (N + 1)
    print(fibonacci(N, dp))


if __name__ == '__main__':
    main()

