k_recursive_Fibonacci_numbers.py

def fibonacci(n):
    if n in (1, 2):
        return 1
    return fibonacci(n - 1) + fibonacci(n - 2)


if __name__ == '__main__':
    n = int(input()) + 1
    print(fibonacci(n))