#include<bits/stdc++.h>
using namespace std;
const int N=200;
int n,hanno[N+1];
void Mu(){
	int cas=0;
	for(int i=N;i>0;i--){
		int t=hanno[i]*2+cas;
		hanno[i]=t%10;
		cas=t/10;
	}
}
void hu(){
	int i=N;
	hanno[i]--;
	while(hanno[i]<0){
		hanno[i]+=10;
		hanno[--i]--;
	}
	
}
int Slove(){
	hanno[N]=1;
	for(int i=0;i<n;i++){
		Mu();
	}
	hu();
	Mu();
	int k=1;
	while(hanno[k]==0){
		k++;
	}
	for(;k<=N;k++){
			cout<<hanno[k];
		}
	}


int main()
{
    cin>>n; 
    Slove();
    return 0;
}