#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
*/

ll comb[35][35];

int main()
{
  int x;
  cin >> x;

  if(x > 31){
    printf("0 0\n");
    return 0;
  }

  comb[0][0] = 1;
  repi(i, 1, 35) rep(j, i+1){
    if(j == 0 or j == i) comb[i][j] = 1;
    else comb[i][j] = comb[i-1][j] + comb[i-1][j-1];
  }

  cout << comb[31][x] << " ";

  ll ans = 0;
  rep(i, 31){
    ans += (1LL<<i) * comb[30][x-1]; 
  }

  cout << ans << endl;

  return 0;
}