#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:https://yukicoder.me/problems/no/420>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

ll next_combination(ll sub) {
    ll x = sub & -sub, y = sub + x;
    return (((sub & ~y) / x) >> 1LL) | y;
}
vector<ll> solve(){
    vector<ll> res;
    ll x; cin >> x;
    if(x > 31 || x == 0) return vector<ll>{0,0};
    ll y = min(x,31-x);
    ll v = 1;
    for(ll yy = 0; yy < y;yy++) v *= (31-yy);
    for(ll yy = 1; yy <= y;yy++) v /= yy;
    res.push_back(v);
    
    ll t = 1;
    for(ll yy = 0; yy < y-1;yy++) t *= (30-yy);
    for(ll yy = 1; yy <= y-1;yy++) t /= yy;
    res.push_back(t*2147483647LL);
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}