dasdas

def prime(n):
    flag = 0
    while flag == 0:
        flag = 1
        n = n+1
        for i in range(2,n-1):
            if n%i == 0:
                flag = 0
                break
    return n

def a(n):
    if n==1:
        return prime(10**14)
    else:
        return prime(a(n-1))

def f(n):
    if n==0:
        return 0
    elif n==1:
        return 1
    else:
        return f(n-1) + f(n-2)

def b(n):
    return f(a(n))



print(prime(6))

total = 0
for k in range(1,100000):
    total += b(k)


print(total)


print("end")