def fib_jump():
    a, b = 13, 21
    while True:
        yield a
        for i in range(4):
            a, b = b, a + b


def search(limit):
    n = 2
    for jump in fib_jump():
        yield n
        n += jump
        limit -= 1
        if not limit:
            return

print(list(search(15))[-1])