def fib_n_efficient(n):
    """Efficient way to compute Fibonacci's numbers. Complexity = O(n)"""
    a = 0
    b = 1
    for i in range(n - 1):
        c = a + b
        a = b
        b = c
    print(b)
    return b