#include <iostream>
#include <queue>
#include <map>
using namespace std;

int main() {
	int x;cin>>x;
if(x==0){
cout<<1<<" "<<0<<endl;
return 0;
}
	int cnt=0;
	long long ans=0;
	queue<pair<long long ,long long>>que;
	que.push(make_pair(1,1));
	while(!que.empty()){
		pair<long long,long long> p;
		p = que.front();que.pop();
		if(p.second==x){
			cnt++;
			ans+= p.first;
		}
		if(p.second<=x){
			if(p.first*2<=2147483647)que.push(make_pair(p.first*2,p.second));
			if(p.first*2+1<=2147483647)que.push(make_pair(p.first*2+1,p.second+1));
		}
	}
	cout<<cnt<<" "<<ans<<endl;
	return 0;
}