def F(n):
if n < 2: return n
else: return F(n-1)+F(n-2)
#initialization
N = 200001
a = [i for i in range(N,-1,-1)]
i = 0
k = 0
b = []
while k <= len(a):
k = F(i)
b.append(k)
i += 1
k = 0
#calculation
for i in enumerate(a):
if i[0] in b:
k += i[1]
print(k)
