#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)

typedef long long ll;

int one;
int two;
int zero;
struct Fibonacci {
    ll mod;
    ll add(ll x, ll y) { return (x += y) >= mod ? x - mod : x; }
    template<class... T> ll add(ll x, T... y) { return add(x, add(y...)); }
    ll mul(ll x, ll y) {
        return x * y % mod;
    }
    template<class... T> int mul(int x, T... y) { return mul(x, mul(y...)); }
    int sub(int x, int y) { return add(x, mod - y); }
    int modpow(int a, long long b) {
        int ret = one; while (b > zero) {
            if (b & one) ret = (long long) ret * a % mod; a = (long long) a * a % mod; b >>= one;
        } return ret;
    }
    int modinv(int a) { return modpow(a, mod - two); }

    typedef vector<ll> Vec;
    typedef vector<Vec> Mat;
    Vec mulMatVec(Mat a, Vec b)
    {
        int n = b.size(); Vec ret(n, zero);
        rep(i, zero, n) rep(j, zero, n) ret[i] = add(ret[i], mul(a[i][j], b[j]));
        return ret;
    }
    Mat mulMatMat(Mat a, Mat b)
    {
        int n = a.size(); Mat ret(n, Vec(n, zero));
        rep(i, zero, n) rep(j, zero, n) rep(k, zero, n) ret[i][j] = add(ret[i][j], mul(a[i][k], b[k][j]));
        return ret;
    }
    Mat fastpow(Mat x, ll n)
    {
        Mat ret(x.size(), Vec(x.size(), zero));
        rep(i, zero, x.size()) ret[i][i] = one;
        while (zero < n) { if (!(n % two)) { x = mulMatMat(x, x); n >>= one; } else { ret = mulMatMat(ret, x); --n; } }
        return ret;
    }
    void printVec(Vec a) { cout << "[\t"; rep(i, zero, a.size()) cout << a[i] << "\t"; cout << "]" << endl; }
    void printMat(Mat a) { rep(i, zero, a.size()) printVec(a[i]); }

    ll query(ll N, ll _mod) {
        mod = _mod;
        Mat m = Mat(two, Vec(two, zero));
        m[zero][zero] = one;
        m[zero][one] = one;
        m[one][zero] = one;

        Vec v = Vec(two, zero);
        v[zero] = one;
        v[one] = two;

        m = fastpow(m, N);
        v = mulMatVec(m, v);

        return v[one];
    }
};
ll N;
int main() {
    zero = (int) string("").size();
    one = (int) string(".").size();
    two = (int) string("..").size();
    int seven = (int) string(".......").size();
    int ten = (int) string("..........").size();
    ll mod = ten * ten * ten * ten * ten * ten * ten * ten * ten + seven;
    int T; cin >> T;
    while(cin >> N) {
        Fibonacci fib;
        ll ans = fib.query(N, mod);
        cout << ans << endl;
    }
}