#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<int>>;

int main(){
  // input
  ll N; cin >> N;
  
  // solve
  int K = 0;
  for(int i = 0; i < 60; i++){
    if(N & (1LL<<i)) K++;
  }
  
  // cout << K << endl;
  
  cout << (K >= 2 ? (1LL << K) - 2 : 0) << endl;
  
  // output
  
  
}