# https://codeforces.com/problemset/problem/1985/B

# line 1    : t = number of test cases
# line 2    : n

# Return sum of multiples of x that are <= n
def sum_multiples_of(x, n):
    sum_multiples = 0
    i = 1
    while x * i <= n:
        sum_multiples += x * i
        i += 1
    return sum_multiples

# Main function
t = int(input())
for _ in range(t):
    n = int(input())
    x = 2
    optimal = x
    optimal_sum = 0
    while x <= n:
        sum_multiples = sum_multiples_of(x, n)
        if sum_multiples > optimal_sum:
            optimal = x
            optimal_sum = sum_multiples
        x += 1
    print(optimal)