#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int)N;i++)
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;

ll C[35][35];
void combination(){
	REP(i,0,32) C[i][0]=C[i][i]=1;
	REP(i,2,32) REP(j,1,32){
		C[i][j]=C[i-1][j-1]+C[i-1][j];
	}
}

int main(){
	int x;
	cin>>x;
	if(x>31) cout<<0<<" "<<0<<endl;
	else if(x==0) cout<<1<<" "<<0<<endl;
	else{
		combination();
		cout<<C[31][x]<<" "<<((1<<31)-1)*C[30][x-1]<<endl;
	}
	return 0;
}