#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

typedef long long ll;

int comb[32][32];

int C(int n, int k) {
    if (comb[n][k]) return comb[n][k];
    else if (k == 0 || k == n) return comb[n][k] = 1;
    else return comb[n][k] = C(n-1,k) + C(n-1,k-1);
}

int main(void) {
    int i, x;
    cin >> x;
    if (x == 0) {
        cout << 1 << " " << 0 << endl;
    }
    else if (x > 31) {
        cout << 0 << " " << 0 << endl;
    }
    else {
        ll ans = 0;
        REP (i,31) {
            ans += (1LL<<i) * C(30,x-1);
        }
        cout << C(31,x) << " " << ans << endl;
    }
    return 0;
}