import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



long X;

void main() {
  const string FLAG = "gnirahs=psu?tide/MBsVrTnZWZlX686lskQ4qf32jKuGGRFUATVZk9J-hTM1/d/tnemucod/moc.elgoog.scod//:sptth";
  stderr.writeln(FLAG.idup.to!(char[]).reverse);
  
  int[] xs;
  foreach (c; 1 .. 15) {
    xs ~= ((1 << c) - 1);
  }
  foreach (c; 1 .. 15) foreach (b; 1 .. c) foreach (a; 1 .. b) {
    xs ~= ((1 << c) - 1) ^ ((1 << b) - (1 << a));
  }
  xs.sort;
  debug {
    writeln(xs);
  }
  stderr.writeln(xs[166]);
  
  try {
    for (; ; ) {
      X = readLong();
      
      long x = X;
      BigInt ans;
      for (long n = 1; ; ++n) {
        // 101
        if (x > (n - 1) * (n - 2) / 2) {
          x -= (n - 1) * (n - 2) / 2;
        } else {
          // p + q + r = n
          foreach (p; 1 .. n) {
            if (x > n - p - 1) {
              x -= n - p - 1;
            } else {
              foreach_reverse (q; 1 .. n - p) {
                if (x > 1) {
                  x -= 1;
                } else {
                  const r = n - p - q;
                  ans = (BigInt(1) << n) - 1;
                  ans ^= (BigInt(1) << (q + r)) - (BigInt(1) << r);
                  break;
                }
              }
              break;
            }
          }
          break;
        }
        
        // full
        if (x > 1) {
          x -= 1;
          
        } else {
          ans = (BigInt(1) << n) - 1;
          break;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}