#include<algorithm>
#include<cstdio>
#include<queue>
#include<cstring>
#define inf 1000000007
using namespace std;
int f[2005][30][4],ans,t,n;
int main(){
    //freopen("a.in","r",stdin);
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);memset(f,0,sizeof(f));ans=0;
        for(int i=1;i<=26;++i)f[1][i][1]=1;
        for(int i=1;i<=n;++i){
            for(int j=1;j<=26;++j)
                for(int p=1;p<=26;++p){
                    if(p==j){
                        for(int k=1;k<=min(2,i-1);++k){
                            f[i][j][k+1]+=f[i-1][p][k];f[i][p][k+1]%=inf;
                        }
                    }
                    else{
                        for(int k=1;k<=min(3,i-1);++k){
                            f[i][j][1]+=f[i-1][p][k];f[i][j][1]%=inf;
                        }
                    }
                }
        }
        for(int i=1;i<=26;++i){
                for(int k=1;k<=3;++k){
                    ans+=f[n][i][k];ans%=inf;
                }
        }
        printf("%d\n",ans);
    }
    return 0;
}