#include <bits/stdc++.h>
using namespace std;
using LL=long long;
template<class T>void sort(vector<T> &v){sort(v.begin(),v.end());}
template<class T>int lower_bound(vector<T> &v, T key){
	return distance(v.begin(), lower_bound(v.begin(),v.end(),key));
}
template<class T>int upper_bound(vector<T> &v, T key){
	return distance(v.begin(), upper_bound(v.begin(), v.end(), key));
}


int main(){
	LL m;cin>>m;

	LL ans=1;

	for(int i=1;i<=128;i++){
		ans*=2;
		ans%=m;
	}
	cout<<ans<<endl;
	return 0;
}