#include "bits/stdc++.h" using namespace std; #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i)) static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL; typedef vector vi; typedef pair pii; typedef vector > vpii; typedef long long ll; template static void amin(T &x, U y) { if (y < x) x = y; } template static void amax(T &x, U y) { if (x < y) x = y; } int main() { int n; while (~scanf("%d", &n)) { int a[]={ 0, 2, 4, 9, 18, 37, 75, 150, 300, 601, 1202, 2405, 4811, 9622, 19244, 38489, 76978, 153957, 307915, 615830, 1231660, 2463321, 4926642, 9853285, 19706571, 39413142, 78826284, 157652569, 315305138 }; int ans = a[n]; printf("%d\n", ans); } return 0; }