#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(ll i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

ll x;
long long comb[51][51];
void combinationDP(int n) {
    for (int i = 0; i < n + 1; i++) {
        for (int j = 0; j < i + 1; j++) {
            if (j == 0 || i == j) comb[i][j] = 1;
            else comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
        }
    }
}
ll ans1, ans2;
int main(){
    cin>>x;
    if(x>31){
        cout<<0<<" "<<0<<endl;
        return 0;
    }
    combinationDP(40);
    ans1 = comb[31][x];
    ans2 = ((1LL<<31)-1LL) * comb[30][x-1];
    cout<<ans1<<" "<<ans2<<endl;
    return 0;
}