Link to this code: https://cses.fi/paste/3ec956b8fc0fddff512d19/
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const ll mod = 1e9 + 7;
const ll N = 1e6 + 10;


int main() {
    ll OneBlock[N], TwoBlocks[N];
    OneBlock[1] = TwoBlocks[1] = 1;

    for (int i = 2; i < N; i++) {
        OneBlock[i] = (2 * OneBlock[i - 1] + TwoBlocks[i - 1]) % mod;
        TwoBlocks[i] = (4 * TwoBlocks[i - 1] + OneBlock[i - 1]) % mod;
    }

    int t;
    cin >> t;
    while (t--){
        int n; cin >> n;
        cout << (OneBlock[n] + TwoBlocks[n]) % mod << "\n";
    }       
    return 0;
}