Positive integer x is called divisor of positive integer y, if y is divisible by x without remainder. For example, 1 is a divisor of 7 and 3 is not divisor of 8.

We gave you an integer d and asked you to find the smallest positive integer a, such that 

  * a has at least 4 divisors; 
  * difference between any two divisors of a is at least d.

Input

The first line contains a single integer t (1 ≤ t ≤ 3000) — the number of test cases.

The first line of each test case contains a single integer d (1 ≤ d ≤ 10000).

Output

For each test case print one integer a — the answer for this test case.

Example

Input


2
1
2


Output


6
15

Note

In the first test case, integer 6 have following divisors: [1, 2, 3, 6]. There are 4 of them and the difference between any two of them is at least 1. There is no smaller integer with at least 4 divisors.

In the second test case, integer 15 have following divisors: [1, 3, 5, 15]. There are 4 of them and the difference between any two of them is at least 2.

The answer 12 is INVALID because divisors are [1, 2, 3, 4, 6, 12]. And the difference between, for example, divisors 2 and 3 is less than d=2.
import java.util.Scanner;

//CODEFORCES ROUND 696 DIV(2) problem B
public class DIVISOR {
    public static void main(String[] args)
    {
        Scanner scan = new Scanner(System.in);
        int T = scan.nextInt();
        StringBuffer sb = new StringBuffer();
        while (T-->0)
        {
            int N = scan.nextInt();
            sb.append(solve(N)+"\n");
        }
        System.out.print(sb);
    }

    private static boolean isPrime(long n)
    {
        boolean status = true;
        for(int i=2;i<=Math.sqrt(n);i++)
        {
            if(n%i==0)return false;
        }
        return status;
    }
    private static long solve(int n) {
        long low = 1+n;
        long high = 100000;
        long num2 = 0;
        while (high-low>n)
        {
            long mid = (low+high)>>1;
            boolean stat = isPrime(mid);
            if(Math.abs(mid-1)>n || stat)high=mid;
            else if(Math.abs(mid-1)<n || stat)low = mid;
            else break;
        }
        for (int i=(int)low;i<=high;i++)
        {
            if(isPrime(i) && Math.abs(i-1)>=n)
            {
                num2=i;
                break;
            }
        }
        low = num2+n; high = 100000;
        while (high-low>n)
        {
            long mid = (low+high)>>1;
            boolean stat = isPrime(mid);
            if(Math.abs(mid-num2)>n || stat)high=mid;
            else if(Math.abs(mid-num2)<n || stat)low = mid;
            else break;
        }
        long num3 = 0;
        for (int i=(int)low;i<=high;i++)
        {
            if(isPrime(i) && Math.abs(i-num2)>=n)
            {
                num3=i;
                break;
            }
        }
        return num2*num3;
    }
}
