#include #include #include #include #define LD double #define LL long long #define Re register int using namespace std; const int N=262144+3,P=167772161,G=3; int n,m,invn,invG,tr[N],A[20][N]; inline void in(Re &x){ int f=0;x=0;char c=getchar(); while(c<'0'||c>'9')f|=c=='-',c=getchar(); while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar(); x=f?-x:x; } inline int mi(Re x,Re k){ Re s=1; while(k){ if(k&1)s=(LL)s*x%P; x=(LL)x*x%P,k>>=1; } return s; } inline int inv(Re x){return mi(x,P-2);} inline void NTT(Re *f,Re n,Re op){ for(Re i=0;i>1,w1=mi(op?invG:G,(P-1)/p);st>1]>>1)|((i&1)?n>>1:0); NTT(f,n,0),NTT(g,n,0); for(Re i=0;i>1; CDQ(L,mid,deep+1); for(Re i=0;i<=mid-L+1;++i)A[deep][i]=A[deep+1][i]; CDQ(mid+1,R,deep+1); times(A[deep],mid-L+1,A[deep+1],R-mid); } int s[N]; inline void get_Stirling(Re n){ invG=inv(G),CDQ(0,n-1,0); for(Re i=0;i<=n;++i)s[i]=A[0][i]; } int main(){ // freopen("123.txt","r",stdin); in(n),get_Stirling(n); for(Re i=0;i<=n;++i)printf("%d ",s[i]); }