#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const LL mod=1000000007;
LL dp[2005][26][3];
int main() {
    int T;
    scanf("%d", &T);
    for (int i = 0; i < 26; ++i)dp[1][i][0] = 1;
    for (int i = 2; i <= 2000; ++i) {
        for (int j = 0; j < 26; ++j) {
            for (int k = 0; k < 26; ++k) {
                if (j != k) {
                    dp[i][j][0] = ((dp[i - 1][k][2] + dp[i][j][0]) % mod + (dp[i - 1][k][0] + dp[i - 1][k][1]) % mod) % mod;
                } else {
                    dp[i][j][1] = dp[i - 1][k][0];
                    dp[i][j][2] = dp[i - 1][k][1];
                }
            }
        }
    }
    while (T--) {
        LL ans = 0;
        int n;
        scanf("%d", &n);
        for (int i = 0; i < 26; ++i) {
            ans = ((ans + dp[n][i][2]) % mod + (dp[n][i][0] + dp[n][i][1]) % mod) % mod;
        }
        cout << ans << endl;
    }
    return 0;
}