Chef has a strip of length $N$ units and he wants to tile it using $4$ kind of tiles

-A Red tile of $2$ unit length

-A Red tile of $1$ unit length

-A Blue tile of $2$ unit length

-A Blue tile of $1$ unit length   
Chef is having an infinite supply of each of these tiles. He wants to find out the number of ways in which he can tile the strip. Help him find this number.
Since this number can be large, output your answer modulo 1000000007 ($10^9 + 7$).

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains of a single line of input, an integer $N$. 

-----Output:-----
For each testcase, output in a single line your answer modulo 1000000007.

-----Constraints-----
- $1 \leq T \leq 1000$
- $2 \leq N \leq 10^{18}$

-----Sample Input:-----
1
2

-----Sample Output:-----
6

-----EXPLANATION:-----

It can be seen that for a strip of length $2$, there are $6$ possible configurations.     
$NOTE : $ 2 tiles of 1 unit length are different from 1 tile of 2 unit length.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# Fibonacci Series using \r\n# Optimized Method \r\n\r\n# function that returns nth \r\n# Fibonacci number\r\nMOD = 1000000007\r\ndef fib(n):\r\n    F = [[2, 2],\r\n         [1, 0]]\r\n    power(F, n - 1)\r\n    ans = [6, 2]\r\n    return (F[0][0] * 6 + F[0][1] * 2) % MOD\r\n    # return F[0][0]\r\n\r\n\r\ndef multiply(F, M):\r\n    x = (F[0][0] * M[0][0] +\r\n         F[0][1] * M[1][0]) % MOD\r\n    y = (F[0][0] * M[0][1] +\r\n         F[0][1] * M[1][1]) % MOD\r\n    z = (F[1][0] * M[0][0] +\r\n         F[1][1] * M[1][0]) % MOD\r\n    w = (F[1][0] * M[0][1] +\r\n         F[1][1] * M[1][1]) % MOD\r\n\r\n    F[0][0] = x\r\n    F[0][1] = y\r\n    F[1][0] = z\r\n    F[1][1] = w\r\n\r\n\r\ndef power(F, n):\r\n    if n == 0 or n == 1:\r\n        return\r\n    M = [[2, 2],\r\n         [1, 0]]\r\n\r\n    power(F, n // 2)\r\n    multiply(F, F)\r\n\r\n    if n % 2 != 0:\r\n        multiply(F, M)\r\n\r\n\r\nfor _ in range(int(input())):\r\n    n = int(input())\r\n    ans = 1\r\n    if n == 0:\r\n        ans = 1\r\n    elif n == 1:\r\n        ans = 2\r\n    elif n == 2:\r\n        ans = 6\r\n    else:\r\n        ans = fib(n-1)\r\n    print(ans)\r\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13409