#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int bitcntll(unsigned long long x) {
    x = (x & 0x5555555555555555) + ((x >> 1) & 0x5555555555555555);
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333);
    x = (x & 0x0f0f0f0f0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f0f0f0f0f);
    x = (x & 0x00ff00ff00ff00ff) + ((x >> 8) & 0x00ff00ff00ff00ff);
    x = (x & 0x0000ffff0000ffff) + ((x >> 16) & 0x0000ffff0000ffff);
    x = (x & 0x00000000ffffffff) + ((x >> 32) & 0x00000000ffffffff);
    return (int)x;
}

vector<vector<long long>> combinations(int n){
    auto res = vector<vector<long long>>(n + 1, vector<long long>(n + 1));
    for(int i=0; i<=n; ++i)res[i][0] = 1;
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= i; ++j)
        res[i][j] = res[i - 1][j - 1] + res[i - 1][j];
    return res;
}

int main(){
    ll x;
    cin >> x;
    if(x == 0){
        puts("1 0");
        return 0;
    }
    
    if(x > 31){
        puts("0 0");
        return 0;
    }

    auto C = combinations(31);
    ll ansA = C[31][x], ansB = 0;
    rep(i, 31){
        ansB += (1ll << i)*C[30][x - 1];
    }
    cout << ansA << ' ' << ansB << endl;
}