【2047】阿牛的EOF牛肉串

2047
递推

Sample Input
1
2

Sample Output
3
8

#include<bits/stdc++.h>
using namespace std;
long long a[41],b[41];
void fn(){
	a[1]=2;
	b[1]=1;
	for(int i=2;i<41;i++){
		a[i]=(a[i-1]+b[i-1])*2;
		b[i]=a[i-1];
	}
}

int main(){
	int n;
	fn();
	while(scanf("%d",&n)!=EOF){
		printf("%lld\n",a[n]+b[n]);
	}
	return 0;
}