#include #include #include #define REP(i,N) for(int i=0,__i=N;i<__i;++i) #define REP2(i,j,N) for(int i=j,__i=N;i<__i;++i) #define Q 1000000007 typedef unsigned long long ll; ll M; bool input(){ using namespace std; cin>>M; if(M<1||M>pow(2,60)) return false; return true; } ll solve(){ using namespace std; ll res=1; REP(i,128){ res=(res*2)%M; } return res; } int main(){ using namespace std; if(!input()) return -1; ll n=solve(); cout<