1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 2100005
#define nm 105
using namespace std;
const double pi=acos(-1);
const ll inf=998244353;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,cnt,tot;
ll f[NM],a[NM],b[NM],p[NM],inv[NM];
ll qpow(ll x,ll t){return t?qpow(sqr(x)%inf,t>>1)*(t&1?x:1ll)%inf:1ll;}
struct FFT{
int n,bit,rev[NM];
ll b[NM],invn;
void fft(ll*a,int f){
inc(i,0,n-1)if(i<rev[i])swap(a[i],a[rev[i]]);
for(int k=1;k<n;k<<=1){
ll t=qpow(3,(inf-1)/k/2);if(f==-1)t=qpow(t,inf-2);
for(int i=0;i<n;i+=k<<1){
ll w=1;
for(int j=0;j<k;j++,w=w*t%inf){
ll x=a[i+j],y=w*a[i+j+k]%inf;
a[i+j]=(x+y)%inf;a[i+j+k]=(x-y+inf)%inf;
}
}
}
}
int plu(ll*a,ll*_b,int p,int m){
inc(i,0,m)b[i]=_b[i];
for(n=p+m+1,bit=0;succ(bit)<n;bit++);n=succ(bit);
invn=qpow(n,inf-2);
inc(i,0,n-1)rev[i]=(rev[i>>1]>>1)|((i&1)<<(bit-1));
fft(a,1);fft(b,1);inc(i,0,n-1)a[i]=a[i]*b[i]%inf;
fft(a,-1);inc(i,0,n-1)a[i]=a[i]*invn%inf;
inc(i,0,n-1)b[i]=0;
return m+p;
}
}fft;
void cdq(int l,int r){
if(l==r){f[l]=f[l]*inv[l]%inf;return;}
int mid=l+r>>1,cnt=r-l,tot=mid-l;
cdq(l,mid);
inc(i,l,mid)a[i-l]=f[i];
inc(i,1,cnt)b[i]=1ll*i*i%inf;
tot=fft.plu(a,b,tot,cnt);
inc(i,mid+1,r)f[i]+=a[i-l];
inc(i,0,tot)a[i]=0;
inc(i,1,cnt)b[i]=0;
cdq(mid+1,r);
}
int main(){
n=1e5;inv[1]=p[1]=p[0]=inv[0]=f[0]=1;
inc(i,2,n)inv[i]=inv[inf%i]*(inf-inf/i)%inf,p[i]=p[i-1]*i%inf;
cdq(0,n);
inc(i,1,n)f[i]=f[i]*p[i]%inf;
while(~scanf("%d",&n))printf("%lld\n",f[n]);
return 0;
}
|
