#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll inf = 1LL << 50;
const ll MOD = 1e9 + 7;
struct edge { ll from; ll to; ll cost; };

ll comb[55][55];
ll beki[37];
void combinit(ll p) {
	for (int i = 0; i <= p; i++) {
		comb[i][0] = 1LL;
		comb[i][i] = 1LL;
	}
	for (int i = 1; i <= p; i++) {
		for (int j = 1; j <= i - 1; j++) {
			comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
		}
	}
}



int main(){
	ll x;
	cin >> x;
	combinit(50);

	beki[0] = 1;
	rep(i, 0, 35) {
		beki[i + 1] = beki[i] * 2;
	}

	ll ans1 = 0;
	ll ans2 = 0;
	if (x <= 31 && x >= 1){
		ans1 = comb[31][x];
		rep(i, 0, 31) {
			ans2 += beki[i] * comb[30][x-1];
		}
	}
	else if (x == 0) {
		ans1 = 1;
		ans2 = 0;
	}
	cout << ans1 << " " << ans2 << endl;
	return 0;
}