rt，代码如下

#include <bits/stdc++.h>
#define mod 20040313
using namespace std;
inline int read(){
	int x=0;bool f=1;char c=getchar();
	while(c>'9'||c<'0'){if(c=='-')f=0;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return f?x:-x;
}
int n,inv[10000005]={1,1},ans;
int main(){
	n=read();
	for(int i=2;i<=n;i++)
		inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
	for(int i=1;i<=n;i++)
		ans+=inv[i],ans%=mod;
	printf("%lld\n",1ll*n*ans%mod);
    return 0;
}