View Code of Problem 60

/*
#include<bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	cin>>T;
	int cns=0;
	while(T--)
	{
		cns++;
		int n;
		cin>>n;
		long long int count=0;
		long long int temp[1001]={0},result[1001]={0};
		long long int num=pow(2,n)-1;
		if(num==1||num==0)
		{
			if(num==1)
			{	
				cout<<"Scenario #"<<cns<<":"<<endl;
				cout<<2<<endl;
				cout<<endl;
			}
			if(num==0)
			{
				cout<<"Scenario #"<<cns<<":"<<endl;				
				cout<<1<<endl;
				cout<<endl;
			}
		}
		else
		{
			for(long long int i=1;i<=num;i++)
			{
				int flag=0;
				long long int k=i;
				long long int j=0;
				long long int h=0;
				while(k>0)
				{
					temp[j++]=k%2;
					k=k/2;	
				}
				for(long long int i=j-1;i>=0;i--)
				{
					result[h]=temp[i];
					h++;
				}
				long long int g;
				for(g=0;g<h;g++)
				{
					if(h==1)continue;
					else
					{
						if(result[g]==1&&result[g+1]==1)
						{
							count=count+1;
							break;
						}						
					}
				}
			}
		cout<<"Scenario #"<<cns<<":"<<endl;
		cout<<num+1-count<<endl;
		cout<<endl;			
		}
	}
}
*/
#include<bits/stdc++.h>
using namespace std;
int a[1001];
int main()
{
	int T;
	cin>>T;
	int cns=0;
	while(T--)
	{
		cns++;
		int n;
		cin>>n;
		a[0]=0;
		a[1]=2; 
		a[2]=3;
		for(int i=3;i<=n;i++)
		{
			a[i]=a[i-1]+a[i-2];
		}
		cout<<"Scenario #"<<cns<<":"<<endl;
		cout<<a[n]<<endl;
		cout<<endl;
	}
}