#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll kaijo[2000010];
void init() {
	kaijo[0] = 1;
	for (ll i = 1;i <= 2000000;i++)kaijo[i] = (kaijo[i - 1] * i) % N;
}
 
ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}
 
ll Comb(ll n, ll k) {
	if (n < 0 || k < 0 || (n - k) < 0)return 0;
	ll b = kaijo[n];
	ll c = kaijo[n - k];
	ll d = kaijo[k];
	ll cd = (c*d) % N;
	return ((b%N)*(inv(cd,N-2)) % N) % N;
}


int main(void){
	ll x;
	cin>>x;
	if(x>31){
		cout<<0<<" "<<0<<endl;
		return 0;
	}
	if(x==0){
		cout<<1<<" "<<0<<endl;
		return 0;
	}
	ll num1 = 1,num2 = 1;
	for(ll i=0;i<x;i++){
		num1*=(31-i);
		num2*=(i+1);
		if(num1%num2==0){
			num1/=num2;
			num2=1;
		}
	}
	cout<<num1<<" ";
	ll ans = 0;
	for(ll i=0;i<31;i++){
		ll X = 1LL<<i;
		ll t1=1,t2=1;
		for(ll i=0;i<x-1;i++){
			t1*=(30-i);
			t2*=(i+1);
			if(t1%t2==0){
				t1/=t2;
				t2=1;
			}
		}
		ans += t1*X;
	}
	cout<<ans<<endl;
	return 0;
}