Q = int(input())

for _ in range(Q):
    N = int(input())

    # print(N)

    n_factorial = 1
    for n in range(1, N + 1):
        solved = False

        n_factorial *= n
        if n_factorial % N == 0:
            coefficient = n_factorial // N

            # print(n, coefficient)

            k_factorial = 1
            n_k_factorial = n_factorial
            for k in range((n + 1) // 2):
                k_factorial = max(k_factorial * k, 1)
                if k > 0:
                    n_k_factorial = n_k_factorial // (n - k + 1)
                if k_factorial * n_k_factorial == coefficient:
                    if (n == 1):
                        print(n)
                    else:
                        print(n + 1)
                    solved = True
                    break

        if solved:
            break

    # print()