//No.354 メルセンヌ素数 #pragma GCC optimize("O3") #pragma GCC target("avx") #include #define rep(i ,n) for(int i=0;i<(int)(n);++i) using namespace std; signed main(){ int q; cin >> q; /*long long n = (long long)pow(2 , q )- 1; int sum = 0; while( n ){ if( n % 2 == 1) ++sum; n /= 2; } */ cout << q << endl; }