#include<bits/stdc++.h>
using namespace std;
int ansdp(int n){
if(n==0){
return 1;
}
int a[n];
int b[n];
a[0] = b[0] = 1;
for(int i=1;i<n;i++){
a[i] = b[i-1];
b[i] = b[i-1] +a[i-1];
}
return a[n-1] + b[n-1];
}
int main() {
int t;
cin>>t;
for(int i=0;i<t;i++){
int n;
cin>>n;
return ansdp(n);
}
}
here a[i] represents all strings ending with 1 and b[i] represents all strings ending with 0.