#include <algorithm>
#include <cstdio>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <cassert>
#include <cfloat>
#include <climits>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std; 
typedef long long ull;

int main() {
	int x;
	ull C[32][32];
	for (int i = 0; i < 32; i++) {
		C[i][0] = 1;
		C[0][i] = 1;
	}
	for (int i = 1; i < 32; i++) {
		for (int j = 1; j < 32; j++) {
			C[i][j] = C[i - 1][j] + C[i][j - 1];
		}
	}
	cin >> x;
	cerr << C[31][16]<<endl;
	if (x >= 32) {
		cout << 0 << " " << 0 << endl;
	}
	else if (x == 0) {
		cout << 1 << " " << 0 << endl;
	}
	else {
		cout << C[31-x][x] << " " << (((ull)1<<31)-(ull)1)*C[31-x][x-1] << endl;
	}
	

	return 0;
}