count number of binary strings
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[106][2];
const int mod = (1e9 + 7);
ll func(ll n,ll prev)
{
if(n==0)
return 1;
if(n<0)
return 0;
if(dp[n][prev]!=-1)
return dp[n][prev];
if(prev==0)
{
dp[n][prev]=(func(n-1,1)%mod + func(n-1,0)%mod)%mod;
}
else
{
dp[n][prev] = func(n-1,0)%mod;
}
return dp[n][prev];
}
int main()
{
ll t;
cin>>t;
while(t–)
{
ll n;
cin>>n;
memset(dp,-1,sizeof(dp));
ll ans=func(n-1,0)+func(n-1,1);
cout<<ans<<endl;
}
}