In [1]:

    

import math
e = math.e


    

In [2]:

    

def gcd(a, b):
  while b:
    a, b = b, a % b
  return a


    

In [3]:

    

def reduce_denom(nom, denom):
  return denom / gcd(nom, denom)


    

In [4]:

    

def is_terminating(denom):
  while denom % 2 == 0:
    denom /= 2
  while denom % 5 == 0:
    denom /= 5
  return denom == 1


    

In [5]:

    

def get_k(N):
  return int(round(N/e))


    

In [ ]:

    

def n_is_t(N):
    k = get_k(N)
    return is_terminating(reduce_denom(N,k))


    

In [6]:

    

q = int(raw_input().strip())
for i in xrange(q):
  n = int(raw_input().strip())
  sumn = 0
  for j in range(5, n + 1):
    k = get_k(j)
    if is_terminating(reduce_denom(j, k)):
      sumn -= j
    else:
      sumn += j
  print(sumn)


    

    




2
89
1591
72
1052

In [ ]: