#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}

int ncr(int n,int r){
    if(r > n/2)r = n - r;
    int a = 1;
    loop(i,1,r+1)a *= i;
    int ret = 1;
    rep(i,r){
        int t = n-i;
        if(a%t == 0)a /= t;
        else ret *= t;
    }
    return ret/a;
}
signed main(void) {
    int x;
    cin >> x;
    if(x > 31)cout << "0 0" << endl;
    else{
        cout << ncr(31,x) << " ";
        if(x == 0) cout << 0 << endl;
        else cout << ((1LL<<31) - 1) * ncr(30,x-1) << endl;
    }
}