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

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
long long map[100];
int main()
{
	int n;
	int i,j;
	map[0]=0;
	for(i=1;i<56;i++)
	{
		map[i]=map[i-1]+pow(2,i);
	}
	while(scanf("%d",&n)!=EOF)
	{
		printf("%lld\n",map[n]);
	}
	return 0;
}