CodeForces 630C Lucky Numbers（递归）

C. Lucky Numbers

time limit per test

0.5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

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.

Examples

input

2

output

6

题意：

幸运数字的个数，即给定一个位数，统计只含有 7 或者 8 的个数。

如 n=2 有7,8,77,78,87,88

思路：

这个题目是很久之前的比赛练习，不知道用的哪个方式求解的，以前水平水，现在依旧。

本次用的递归，就是看看还记不记得递归，数据量也小。

代码：

#include<stdio.h>
#include<math.h>
#define ll long long

__int64 G(int x) {
	if(x==1)
		return 2;
	return G(x-1)+(__int64)pow(2,x);
}

int main() {
	int n;
	while(scanf("%d",&n)!=EOF) {
		__int64 ans=G(n);
		printf("%I64d\n",ans);
	}
	return 0;
}

后：

**********************