#include<bits/stdc++.h> using namespace std; int N=114514; long long qsort (long long a,long long b){ long long a1=a,cnt=1; while (b!=0){ if (b&1!=0){ cnt*=a1; cnt%=N; } a1*=a1; a1%=N; b>>=1; } return cnt%N; } int main(){ long long n; cin>>n; n-=1; cout<<qsort(2,n); }