#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

ll ncr(ll n, ll r) {
	if (n < r || n < 0 || r < 0) return 0;
	ll res = 1, c = 1;
	
	for (ll i = n; i >= n - r + 1; i--) {
		res *= i;
		
		if (c <= r) res /= c++;
	}
	while (c <= r) res /= c++;
	
	return res;
}

int main() {
	ll x;
	cin >> x;
	
	ll cnt, sum;
	
	if (x > 31) cnt = sum = 0;
	else if (x == 0) cnt = 1, sum = 0;
	else {
		cnt = ncr(31, x);
		
		sum = ((1ll<<31) - 1) * ncr(30, x - 1);
	}	
	printf("%lld %lld\n", cnt, sum);
	
	return 0;
}