#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<climits>
#include<iomanip>
#include<cassert>
using namespace std;
typedef long long LL;
typedef long double LB;
#define N 555
#define mod 100007
#define PI acos(-1)
const int INF=INT_MAX;
LL gcd(LL x,LL y)
{
    return y==0?x:gcd(y,x%y);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {

        LL n;
        scanf("%I64d",&n);
        if(n<=3) {printf("%I64d\n",n);continue;}

        int d=24;

        LL s=1;
        for(int i=0;i<=3;i++)
        {
            s*=(n-i)/gcd((n-i),d);
            //cout<<s<<endl;
            d/=gcd(n-i,d);
        }
        printf("%I64d\n",s+n);
    }
    return 0;
}