#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <ctime>
using namespace std;

const long long MOD = 1000000007;

int main(){
    int t;
    scanf("%d", &t);
    while(t--){
        long long n;
        scanf("%I64d", &n);

        vector<long long> dp(4,0);
        dp[0] = 26;
        for(int i=2; i<=n; i++){
            vector<long long> dp_(4,0);
            for(int k=0; k<3; k++){
                dp_[0] += dp[k] * 25 % MOD;
                if(dp_[0]>=MOD) dp_[0] %= MOD;

                if(k+1<4){
                    dp_[k+1] += dp[k];
                    if(dp_[k+1] >= MOD) dp[k+1] %= MOD;
                }
            }
            swap(dp, dp_);
        }

        long long ans = dp[0]+dp[1]+dp[2];
        ans %= MOD;

        printf("%d\n", (int)ans);
    }
    return 0;
}