#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define int long long
using namespace std;
typedef long long ll;
const int INF = 1e9;

ll C[300][300];

void comb_table(int N, int mod)
{
    for (int i=0; i<=N; i++) {
        for (int j=0; j<=i; j++) {
            if (j == 0 or j == i) {
                C[i][j] = 1LL;
            } else {
                C[i][j] = (C[i-1][j-1] + C[i-1][j]) % mod;
            }
        }
    }
}

signed main()
{
    int x;

    cin >> x;

    if (x > 35) {
        cout << "0 0" << endl;
        return 0;
    }

    comb_table(100, 1e13);
    cout << C[31][x] << " ";

    if (x == 0) {
        cout << 0 << endl;
        return 0;
    }

    int ans = 0;
    int val = 1;
    REP(i,31) {
        ans += val * C[30][x-1];
        val *= 2;
    }

    cout << ans << endl;
}