CodeForces-630C. Lucky Numbers

Lucky Numbers

Time Limit:500MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

The numbers of all offices in the new building of the Tax Office of IT City will have lucky numbers.

Lucky number is a number that consists of digits 7 and 8 only. Find the maximum number of offices in the new building of the Tax Office given that a door-plate can hold a number not longer than n digits.

Input

The only line of input contains one integer n (1 ≤ n ≤ 55) — the maximum length of a number that a door-plate can hold.

Output

Output one integer — the maximum number of offices, than can have unique lucky numbers not longer than n digits.

Sample Input

Input

2

Output

6

题目大意：房间号是幸运数字的房间一共是多少间（每个房间房间号都不同），注意幸运号数字是指组成房间号的数字只能是7或8，只有这两种数字种类。

代码如下：

#include<stdio.h>
unsigned long long num[60];
unsigned long long time(int i){
	int j;
	unsigned long long n=1;
	for(j=1;j<=i;j++){
		n*=2;
	}
	return n;
}
int main(){
	int n,i;
	num[0]=0;
	for(i=1;i<=55;i++){
		num[i]=num[i-1]+time(i);
	}
	while(scanf("%d",&n)!=EOF){
	printf("%llu\n",num[n]);
	}
	return 0;
}