using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var t = NN; var ans = new long[t]; for (var i = 0; i < t; ++i) { var n = NN; ans[i] = Bus(n); } WriteLine(string.Join("\n", ans)); } static long Bus(int n) { var a = new long[][] { new long[] { 0, 1, 0, 0, 0, 0 } }; var b = Matrix.Mul(a, Matrix.Pow(x, n)); return b[0][1]; } static int r3 = 333333336; static long[][] x = new long[][] { new long[] { 0, 1, 0, 0, 0, 0 }, new long[] { 0, r3, r3, 0, r3, 0 }, new long[] { 0, 0, 0, 1, 0, 0 }, new long[] { r3, 0, 0, r3, r3, 0 }, new long[] { 0, 0, 0, 0, 0, 1 }, new long[] { r3, 0, r3, 0, 0, r3 }, }; class Matrix { public static int mod = 1_000_000_007; // 行列の累乗 public static long[][] Pow(long[][] m, long k) { var multi = m; var r = new long[m.Length][]; for (var i = 0; i < m.Length; ++i) { r[i] = new long[m.Length]; r[i][i] = 1; } while (k > 0) { if ((k & 1) == 1) r = Mul(r, multi); multi = Mul(multi, multi); k >>= 1; } return r; } // 行列の積 public static long[][] Mul(long[][] x, long[][] y) { var r = new long[x.Length][]; for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length]; for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k) { for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod; } return r; } } }