#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const int Mod = 1000000007;
int n,m;
int dp[2050];
int cheng(int x,int y)
{
    long long z=x;
    z*=y;
    z%=Mod;
    x=z;
    return x;
}
int getint()
{
    int res=0;
    char ch=getchar();
    while(ch<'0' || ch>'9')
        ch=getchar();
    while('0'<=ch && ch<='9')
    {
        res=res*10+ch-'0';
        ch=getchar();
    }
    return res;
}
void f()
{
    int i;
    dp[0]=1;
    for(i=1;i<=n;i++)
    {
        dp[i]=cheng(dp[i-1],26);
        if(i-4>=0)
        {
            if(i==4)
                dp[i]-=cheng(dp[i-4],26);
            else
                dp[i]-=cheng(dp[i-4],25);
            if(dp[i]<0)
                dp[i]+=Mod;
        }
    }
    printf("%d\n",dp[n]);
}
int main()
{
    int T=getint();
    while((scanf("%d",&n))!=EOF)
        f();
    return 0;
}