#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define INF 1e9
#define PI acos(-1)
typedef long long ll;

void comb(vector<vector <long long int> > &v) {
	for (int i = 0; i <v.size(); i++) {
		v[i][0] = 1;
		v[i][i] = 1;
	}
	for (int k = 1; k <v.size(); k++) {
		for (int j = 1; j<k; j++) {
			v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
		}
	}
}

int main() {
	
	int n = 31;
	int x; cin >> x;

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

	ll ans, sum;

	vector<vector<ll> > v(n + 1, vector<ll>(n + 1, 0));
	comb(v);

	ans = v[n][x];

	if (x == 0) sum = 0;
	else sum = ((ll)pow(2, 31) - 1)*v[n - 1][x - 1];

	cout << ans << " " << sum << endl;

	return 0;
}