from functools import lru_cache, reduce
from operator import mul
import sys
from itertools import count
sys.setrecursionlimit(100000)


@lru_cache
def calc_positive_divisors_num(num: int) -> int:
    if num <= 0:
        raise ValueError
    if num == 1:
        return 1
    if num == 2:
        return 2

    factors = calc_prime_factorize(num)
    return reduce(mul, map(lambda num: num + 1, factors.values()))


@lru_cache
def calc_prime_factorize(num: int) -> dict[int, int]:
    if num < 2:
        raise ValueError

    divisors = {}
    for divisor in count(2):
        if divisor ** 2 > num:
            if num != 1:
                divisors[num] = 1
            break
        while num % divisor == 0 and num != 1:
            try:
                divisors[divisor] += 1
            except KeyError:
                divisors[divisor] = 1
            num //= divisor

    return divisors


@lru_cache
def countdown_divisors(num: int) -> int:
    divisors_num = calc_positive_divisors_num(num)
    if num == divisors_num:
        return num
    return countdown_divisors(num - divisors_num)


def main():
    for _ in range(int(input())):
        N = int(input())
        print(countdown_divisors(N))


if __name__ == "__main__":
    main()