#include <bits/stdc++.h>   #pragma GCC optimize(2)   using namespace std;   const long long mod = 998244353;   const long long maxn = 3e5 + 10;   long long p[2] = {1000000007, 998244353};   long long seed[2] = {500000004, 500000004};   int main() {     int x, a[6];     scanf( %d , &x);     for (int i = 0; i < 6; i++)       if (x & (1 << i))         a[i] = 1;       else         a[i] = 0;     swap(a[0], a[4]);     swap(a[2], a[3]);     int y = 0;     for (int i = 0; i < 6; i++)       if (a[i]) y += 1 << i;     printf( %d n , y);     return 0;   }   