//
//  main.cpp
//  bc75.3
//
//  Created by eycia on 16/3/12.
//  Copyright © 2016年 eycia. All rights reserved.
//

#include <cstdio>
#include <cstring>

#define MOD 1000000007;

long long f[2005][4];

void work() {
    int n;
    scanf("%d", &n);
    memset(f, 0, sizeof(f));
    
    f[1][0] = 26;
    for (int i = 2; i <= n; i++) {
        long long cnt = 0;
        for (int j = 0; j < 3; j++) {
            cnt = (cnt + f[i-1][j]) % MOD;
        }
        f[i][0] = (cnt*25) % MOD;
        for (int j = 1; j < 3; j++) {
            f[i][j] = f[i-1][j-1];
        }
    }
    
    long long cnt = 0;
    for (int i = 0; i < 3; i++) {
        cnt = (cnt + f[n][i]) % MOD;
    }
    printf("%I64d\n", cnt);
}

int main(int argc, const char * argv[]) {
    int t;
    scanf("%d", &t);
    while (t--) {
        work();
    }
}