#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
const int N=3e5+5;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int P=1004535809,MOD=P;
ll Pow(ll a,ll b,ll MOD){ll ans=1;for(;b;b>>=1,a=a*a%MOD)if(b&1) ans=ans*a%MOD;return ans;
}
struct NTT{int n,rev[N];ll g;void ini(int m){n=1;while(n<m) n<<=1;/*int k=0;while((1<<k)<n) k++;for(int i=0;i<n;i++){int t=0;for(int j=0;j<k;j++) if(i&(1<<j)) t|=(1<<(k-j-1));rev[i]=t;}*/g=3;}void transform(int *a,int flag,int n){int k=0;while((1<<k)<n) k++;for(int i=0;i<n;i++){int t=0;for(int j=0;j<k;j++) if(i&(1<<j)) t|=(1<<(k-j-1));if(t<i) swap(a[i],a[t]);}for(int l=2;l<=n;l<<=1){int m=l>>1;ll wn=Pow(g,flag==1?(P-1)/l:P-1-(P-1)/l,P);for(int *p=a;p!=a+n;p+=l){ll w=1;for(int k=0;k<m;k++){ll t=w*p[k+m]%P;p[k+m]=(p[k]-t+P)%P;p[k]=(p[k]+t)%P;w=w*wn%P;}}}if(flag==-1){ll inv=Pow(n,P-2,P);for(int i=0;i<n;i++) a[i]=a[i]*inv%P;}}int c[N];void test(int *a,int n){for(int i=0;i<n;i++) printf("%d ",a[i]);puts("");}void polyInv(int deg,int *a,int *b){if(deg==1) b[0]=Pow(a[0],P-2,P);else{polyInv((deg+1)>>1,a,b);int n=1;while(n< deg<<1) n<<=1;copy(a,a+deg,c);fill(c+deg,c+n,0);transform(c,1,n);transform(b,1,n);for(int i=0;i<n;i++)b[i]=(ll)b[i]*(2-(ll)b[i]*c[i]%P+P)%P;transform(b,-1,n);fill(b+deg,b+n,0);}}
}fft;
int n,inv[N],invFac[N],poc[N],A[N],B[N],C[N];
void getInv(int n){inv[1]=invFac[0]=1;for(int i=1;i<=n;i++){if(i!=1) inv[i]=-(ll)P/i*inv[P%i]%P;if(inv[i]<0) inv[i]+=P;invFac[i]=(ll)invFac[i-1]*inv[i]%P;}
}
int main(){//freopen("in","r",stdin);n=read();fft.ini(n);getInv(n);poc[0]=poc[1]=1;for(int i=2;i<=n;i++) poc[i]=Pow(2,(ll)i*(i-1)>>1%(P-1),P);for(int i=0;i<=n;i++) B[i]=(ll)poc[i]*invFac[i]%P;for(int i=1;i<=n;i++) C[i]=(ll)poc[i]*invFac[i-1]%P;//printf("CC %d\n",C[i]);
    fft.polyInv(fft.n,B,A);fft.n<<=1;fft.transform(A,1,fft.n);fft.transform(C,1,fft.n);for(int i=0;i<fft.n;i++) A[i]=(ll)A[i]*C[i]%P;//,printf("ABC %d %d %d\n",i,A[i],C[i]);
 fft.transform(A,-1,fft.n);printf("%lld",(ll)A[n]*Pow(invFac[n-1],P-2,P)%P);
}