#include <bits/stdc++.h>

#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint1000000007;
void fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
}

using vec = vector<mint>;
using mat = vector<vec>;
mint inv3 = mint(3).inv();
mat A = {
    {inv3, 0, 0, 0, inv3, inv3}, {0, inv3, 0, inv3, 0, inv3},
    {0, 0, inv3, inv3, inv3, 0}, {1, 0, 0, 0, 0, 0},
    {0, 1, 0, 0, 0, 0},          {0, 0, 1, 0, 0, 0},
};
mat mul(mat a, mat b) {
    mat c(6, vec(6));
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < 6; j++) {
            for (int k = 0; k < 6; k++) {
                c[i][k] += a[i][j] * b[j][k];
            }
        }
    }
    return c;
}
mat pow(mat a, long long n) {
    mat b(6, vec(6));
    for (int i = 0; i < 6; i++) {
        b[i][i] = 1;
    }
    while (n > 0) {
        if (n & 1) {
            b = mul(b, a);
        }
        a = mul(a, a);
        n >>= 1;
    }
    return b;
}
int main() {
    fast_io();
    int t;
    cin >> t;
    for (; t--;) {
        int n;
        cin >> n;
        mat B = pow(A, n - 1);
        mint ans = B[0][0] * inv3 + B[0][3];
        cout << ans.val() << '\n';
    }
}