var factorials = [1:1]
func factorial(n: Int) -> Int{
    if let fact = factorials[n]{
        return fact
    }
    if n > 0{
        let r = n*factorial(n: n-1)
        factorials[n] = r
        return r
    }
    return 1
}
func getTiles(n: Int, m: Int) -> Int{
    var result = 0
    for i in 1...n/m{
        let tile = i
        let empty = n-(i*m)
        let sum = tile+empty
        result += factorial(n: sum)/(factorial(n: tile)*factorial(n: empty))
    }
    return result
}
func ways(n: Int) -> Int{
    return getTiles(n: n, m: 2)+getTiles(n: n, m: 3)+getTiles(n: n, m: 4)
}

import java.io.*;
import java.util.*;
import java.math.*;

public class Solution 
{
    static BigInteger permutation(BigInteger n , BigInteger k)
    {
        BigInteger result = BigInteger.ONE;
        for (BigInteger bi = BigInteger.valueOf(1); bi.compareTo(k) <= 0; bi = bi.add(BigInteger.ONE)) 
        {
            result = result.multiply(n);
            result = result.divide(bi);
            n = n.subtract(BigInteger.ONE);
        }
        //System.out.println("Last : "+result);
        return result;

    }
    public static void main(String[] args) 
    {
        Scanner sc = new Scanner(System.in);        
        int testCases = sc.nextInt();
        while(testCases-- >0)
        {
            BigInteger total ;
            total = sc.nextBigInteger();
            BigInteger sum = BigInteger.ZERO;
//            for(int block =2 ; block<=4 ;block++)
            for(BigInteger block =BigInteger.valueOf(2) ; block.compareTo(BigInteger.valueOf(4))<=0 ;block = block.add(BigInteger.ONE))
            {   
                BigInteger maxBlock = total.divide(block);

                for(BigInteger color = BigInteger.valueOf(1); color.compareTo(maxBlock) <= 0; color = color.add(BigInteger.ONE))                               {
                  BigInteger black = total.subtract(color.multiply(block));
                  BigInteger tiles = black.add(color);
                  BigInteger combinations = permutation(tiles,color);
                  sum = sum.add(combinations);
                  sum  = sum.mod(BigInteger.valueOf(1000000007));
                }
            }
            System.out.println(sum);
        }
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
    }
}

import math
def C(n,r):
    f = math.factorial
    return f(n) // f(r) // f(n-r)

t=int(input())
for i in range(t):
    n=int(input())
    r=g=b=0
    for rr in range(1,(n//2)+1):
        r+=C(n-rr,rr)
    for gg in range(1,(n//3)+1):
        g+=C(n-(2*gg),gg)
    for bb in range(1,(n//4)+1):
        b+=C(n-(3*bb),bb)
    print((r+g+b)%1000000007)

for i in range(int(input())):
    a=b=m=n=o=w=x=y=z=1
    for j in range(1,int(input())):
        a,b,m,n,o,w,x,y,z = b,a+b,n,o,o+m,x,y,z,z+w
    print((b+n+x-3)%1000000007)