OussaZaki

def even_fibonacci_sum(n):
    fn_2 = 1 #Fn-2
    fn_1 = 1 #Fn-1
    sum = 0
    while True :
        fn = fn_2 + fn_1 #Fn
        if fn >= n: return sum
        if fn % 2 == 0: sum += fn
        fn_2, fn_1 = fn_1, fn

OussaZaki

def sum(n, k):
    d = n // k
    return k * (d * (d+1)) // 2
  
def euler1(n):
    return sum(n, 3) + sum(n, 5) - sum(n, 15)

t = int(input().strip())
for i in range(t):
    N = int(input().strip())

OussaZaki

long long euler1(long long N) {
  long long i, sum = 0;
  for (i = 3; i < N; i++) {
    if (i % 3 == 0 || i % 5 == 0) {
      sum += i;
    }
  }
  return sum;
}