import math
import sys
sys.set_int_max_str_digits(0)

sq5 = math.sqrt(5)

P = 1000000000000000009
fio = [0, 1]
for i in range(50):
    fio.append((fio[-1] + fio[-2]) % P)

def mul(m1, m2):
    m3 = [[0, 0], [0, 0]]
    for i in range(0, 2):
        for j in range(0, 2):
            for k in range(0, 2):
                m3[i][j] = (m3[i][j] + m1[i][k] * m2[k][j] % P) % P
    return m3


def Fio(n):
 def calc(n):
  if n == 0:
   return (0, 1)
  else:
   a, b = calc(n // 2)
   c = (a * ((2 * b - a) % P)) % P
   d = (a * a + b * b) % P
   if n % 2 == 0:
    return (c, d)
   else:
    return (d, (c + d) % P)
 if n <= 20:
  return fio[n]
 return calc(n - 1)[0] # 跟安子之前的输出保持一致


# def Fio(n):
#     if n <= 20:
#         return fio[n]
#     y = [[1, 0], [0, 1]]
#     x = [[0, 1], [1, 1]]
#     while n > 0:
#         if n % 2 == 1:
#             y = mul(y, x)
#         x = mul(x, x)
#         n //= 2
#     return y[1][0]

def get(x):
    if x <= 20:
        y = 1
        while True:
            if fio[y] >= x:
                return y
            y += 1
    return math.ceil((math.log2(sq5) + math.log2(x)) / math.log2((1 + sq5) / 2))

n = int(input())
a = []
for i in range(0, n):
    a.append(int(input()))


a = sorted(a)

ans = 0

mp = {-1:0}

for j in range(0, n):

    i = get(a[j])

    a[j] %= P
    ans += mp.get((Fio(i) - a[j] + P) % P, 0)
    ans += mp.get((Fio(i + 1) - a[j] + P) % P, 0)

    if mp.get(a[j], 0) == 0:
        mp.update({a[j]:1})
    else:
        mp[a[j]] += 1


print(ans)