#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int x;
void solve()
{
	cin >> x;
	if(x > 31) cout << 0 << " " << 0 << endl;
	else if(x == 0) cout << 1 << " " << 0 << endl;
	else
	{
		auto f = [&](int N,int K) -> long long
		{
			long long num = 1,den = 1;
			for(int i = 1;i <= K;i++)
			{
				num *= N-i+1;
				den *= i;
				if(num%den == 0) num /= den,den = 1;
			}
			return num;
		};

		cout << f(31,x) << " " << ((1LL << 31)-1) * f(30,x-1) << endl;
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}