#include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef pair<int,int> pii;
#define ITR(v,c) for(auto v=begin(c);v!=end(c);v++)
#define FOR(v,a,n) for(int v=a;v<(int)(n);v++)
#define FORE(x,arr) for(auto &x:arr)
#define REP(v,n) FOR(v,0,n)
#define RREP(v,n) for(int v=(int)(n);v>=0;v--)
#define ALL(c) begin(c),end(c)
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
const int INF = 1e9;
const ll INFLL = 1e18;
template<class T,class U>ostream&operator<<(ostream &os,const pair<T,U> &p){
    os<<"("<<p.first<<","<<p.second<<")";return os;}
template<class T>ostream&operator<<(ostream &os,const vector<T> &v){
    ITR(i,v)os<<*i<<(i==end(v)-1?"":"\n");return os;}
//------------------------------------------------------------------------------

//-------- 組み合わせ: nCr → combination[n][r]
const int N_MAX = 32;
ll combination[N_MAX][N_MAX];
void combination_init() {
    for(int i=0; i<N_MAX; i++) combination[i][0] = 1;
    for(int i=1; i<N_MAX; i++) {
        for(int j=1; j<N_MAX; j++) {
            combination[i][j] = combination[i-1][j] + combination[i-1][j-1];
        }
    }
}

signed main() {
    ll x;
    cin>>x;
    if(x==0) {
        cout<<"1 0"<<endl;
        return 0;
    }
    if(x>31) {
        cout<<"0 0"<<endl;
        return 0;
    }

    combination_init();
    cout<<combination[31][x]<<" "<<2147483647*combination[30][x-1]<<endl;
    return 0;
}