#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <stack>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

#define MX 2147483648LL

int main(){
  ios::sync_with_stdio(false);
  ll x;
  cin >> x;

  if(x == 0){
    cout << 1 << " " << 0 << endl;
    return 0;
  }

  vector<ll> v;
  v.push_back(0);  
  
  ll now = 0;
  while(true){
    now++;
    set<ll> w;
    rep(i,v.size()){
      if(2*v[i]+1<MX) w.insert(2*v[i]+1);
    }
    vector<ll> ww;
    FOR(it,w){
      ll a = *it;
      while(a<MX){
        ww.push_back(a);
        a*=2;
      }
    }
    v = ww;
    if(ww.size() == 0 || now == x) break;
  }

  ll sum = 0;
  rep(i,v.size()){
    sum += v[i];
  }
  
  cout << v.size() << " " << sum << endl;
  
  return 0;
}