climb stairs

/*
 climb stairs 
 Ideas ,stair(n) == stair(n-1) + stair(n-2)
 That is to say n The scheme of stairs is equal to walking  n-1 level   add n-2 level 
 Recursive termination condition 
if n == 1 return 1
if n== 2 return 2; 
*/

#include<iostream>
using namespace std;

int stair(int n)
{
	if(n == 1) return 1;
	if(n == 2) return 2;
	
	return stair(n - 1) + stair(n - 2);
}

int main()
{
	int n;
	while(cin >> n){
		cout << stair(n) << endl;
	}
	return 0;
}