#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>;

mat mul(mat a, mat b) {
    mat c(4, vec(4));
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
            for (int k = 0; k < 4; k++) {
                c[i][k] += a[i][j] * b[j][k];
            }
        }
    }
    return c;
}
mat pow(mat a, long long n) {
    mat b(4, vec(4));
    for (int i = 0; i < 4; 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 c, n, m;
        // cin >> c >> n >> m;
        c = 3, m = 1;
        cin >> n;
        mint cinv = mint(c).inv();
        mat A = {{cinv, 0, 0, cinv},
                 {0, cinv, (c - 1) * cinv, (c - 2) * cinv},
                 {1, 0, 0, 0},
                 {0, 1, 0, 0}};
        A = pow(A, n - 1);
        mint p = A[0][0] * cinv + A[0][2];
        mint ans = 1 - (1 - p).pow(m);
        cout << ans.val() << endl;
    }
}