#include <bits/stdc++.h>
using namespace std;
#include<cassert>
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
#define all(A) A.begin(),A.end()
#define ALL(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
using pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;

template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

ll gcd(ll(a), ll(b)) {
    if (b == 0)return a;
    if (a == 0)return b;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}


ll mod = 998244353;
ll modPow(long long a, long long n, long long p) {
    a %= p;
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}


ll inv(ll N) {
    return modPow(N, mod - 2, mod);
}

const ll MoD = 998244353;

void Zetasubtrans(vll& A, int inv) {
    ll N = A.size();
    for (int i = 1; i < N; i *= 2) {
        for (int j = 0; j < N; j++) {
            if (!!(j & i))A[j] += A[i ^ j] * (1 - 2 * inv);
            A[j] %= MoD;
            if (A[j] < 0)A[j] += MoD;
        }
    }
}
void Zetasuptrans(vll& A, int inv) {
    ll N = A.size();
    for (int i = 1; i < N; i *= 2) {
        for (int j = 0; j < N; j++) {
            if (!(j & i))A[j] += A[i | j] * (1 - 2 * inv);
            A[j] %= MoD;
            if (A[j] < 0)A[j] += MoD;
        }
    }
}
vll ORconv(vll& A, vll& B) {
    ll len = max(A.size(), B.size()) - 1, n = 1;
    while (len > 0)len /= 2, n *= 2;
    while (A.size() < n)A.push_back(0);
    while (B.size() < n)B.push_back(0);
    Zetasubtrans(A, 0);
    Zetasubtrans(B, 0);
    vll res(n);
    rep(i, n)res[i] = (A[i] * B[i]) % MoD;
    Zetasubtrans(res, 1);
    return res;
}

vll ANDconv(vll& A, vll& B) {
    ll len = max(A.size(), B.size()) - 1, n = 1;
    while (len > 0)len /= 2, n *= 2;
    while (A.size() < n)A.push_back(0);
    while (B.size() < n)B.push_back(0);
    Zetasuptrans(A, 0);
    Zetasuptrans(B, 0);
    vll res(n);
    rep(i, n)res[i] = (A[i] * B[i]) % MoD;
    Zetasuptrans(res, 1);
    return res;
}


int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    string S;
    cin>>S;
    if(S[0]=='x'){
        cout<<(1ll<<32)-stoll(S.substr(1,S.size()))<<endl;
    }
    else cout<<stoll(S)<<endl;
}