#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
//const int mod = 1000000007;
const ll mod = LINF;

// POWER_MODver. N^k % MOD
ll mod_pow(ll n, ll k){
  ll res = 1;
  for(; k > 0; k >>= 1){
    if(k&1) res = (res*n)%mod;
    n = (n*n)%mod;
  }
  return res;
}


int main()
{
  string s, t;
  cin >> s;
  bool flag = true;
  if (s[0] == 'x') t = s.substr(1);
  else {
    t = s.substr(0);
    flag = false;
  }
  ll n = stoll(t);
  if (!flag) cout << n << endl;
  else cout << mod_pow(2, 32) - n << endl;
  return 0;
}