def strangeCounter(t):
    # Write your code here
    r = math.ceil(math.log2(t/3+1)) # Calculate the number of current round
    sum_full = 3*(2**r-1) # Calculate the time when value reach to 1 at current round
    return sum_full - t + 1

#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);

/*
 * Complete the 'strangeCounter' function below.
 *
 * The function is expected to return a LONG_INTEGER.
 * The function accepts LONG_INTEGER t as parameter.
 */

long strangeCounter(long t) {
    if(t==1)
    {
        return 3;
    }
    else if(t==2)
    {
        return 2;
    }
    else if(t==3)
    {
        return 1;
    }
    else
    {
        long it=3,i=6;
    while(it<t)
    {
        it=it+i;
        i=i*2;
    }
    long diff=it-t;
    return diff+1;
    }
    
}
int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));

    string t_temp;
    getline(cin, t_temp);

    long t = stol(ltrim(rtrim(t_temp)));

    long result = strangeCounter(t);

    fout << result << "\n";

    fout.close();

    return 0;
}

string ltrim(const string &str) {
    string s(str);

    s.erase(
        s.begin(),
        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
    );

    return s;
}

string rtrim(const string &str) {
    string s(str);

    s.erase(
        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
        s.end()
    );

    return s;
}