Just Do It

Time Limit: / MS (Java/Others)    Memory Limit: / K (Java/Others)

Total Submission(s):     Accepted Submission(s): 

Problem Description

Now we define a function F(x), which means the factors of x. In particular, F() = ,since  only has  factor , F() = , since  has  factors , , . Now give you an integer k, please find out the minimum number x that makes F(x) = k.

Input

The first line contains an integer t means the number of test cases.

The follows t lines, each line contains an integer k. ( < k <= ).

Output

For each case, output the minimum number x in one line. If x is larger than , just output -.

Sample Input

Sample Output

-

#include<stdio.h>

#include<string.h>

int main()

{

    int q,i,j,m,n,t,a[],b,c;

    memset(a,,sizeof(a));

    for(i=;i>;i--)

    {

        q=;

        for(j=i;j>;j--)

        {

            if(i%j==)

                q++;

        }

        a[q]=i;

    }

    scanf("%d",&t);

    while(t--)

    {

        scanf("%d",&n);

        m=a[n];

        if(m==)

            m=-;

        printf("%d\n",m);

    }

    return ;

}