func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long M = 1e9 + 7;   long long fastpo(long long a, long long x) {     if (x == 0) return 1ll;     if (x == 1) return a;     long long y = fastpo(a, x / 2);     if (x % 2 == 0) {       return y * y;     }     return y * y * a;   }   long long inv(long long a, long long M) { return fastpo(a, M - 2); }   long long gcdExtended(long long a, long long b, long long *x, long long *y) {     if (a == 0) {       *x = 0, *y = 1;       return b;     }     long long x1, y1;     long long gcd = gcdExtended(b % a, a, &x1, &y1);     *x = y1 - (b / a) * x1;     *y = x1;     return gcd;   }   long long modInverse(long long a, long long m) {     long long x, y;     long long g = gcdExtended(a, m, &x, &y);     if (g != 1)       return -1;     else {       long long res = (x % m + m) % m;       return res;     }   }   long long gcd(long long a, long long b) {     if (a == 0) {       return b;     }     return gcd(b % a, a);   }   long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }   long long N = 2e6 + 5;   vector<long long> dp(N, 0), ci(N, 0), ai(N, 0), bi(N, 0), ans(N, 0);   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     for (int i = 1; i < N; i++) {       if (i == 1) {         dp[i] = 1;         ci[i] = 0;         ai[i] = 0;         bi[i] = 1;         ans[i] = 0;       } else if (i == 2) {         dp[i] = 2;         ci[i] = 0;         ai[i] = 1;         bi[i] = 1;         ans[i] = 0;       } else {         ci[i - 1] = dp[i - 3];         ai[i - 1] = dp[i - 2] - dp[i - 3];         bi[i - 1] = dp[i - 1] - dp[i - 2];         dp[i] = ((ci[i - 1] + ai[i - 1] * 3 + bi[i - 1] * 2) % M + M) % M;         ans[i] = (ans[i - 3] + bi[i - 2]) % M;       }     }     int t;     cin >> t;     while (t--) {       long long n;       cin >> n;       long long res = ((ans[n] * 4) % M + M) % M;       cout << res << endl;     }     return 0;   }   