rt，最后一个点T了

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;
int ksm(int a,int b){
	if(b==1) return a;
	int t=ksm(a,b/2);
	if(b&1){
		return t%mod*t%mod*a%mod;
	}
	else{
		return t%mod*t%mod;
	}
}
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int n;
	scanf("%lld",&n);
	int ans=1;
	for(int i=2;i<=n;i++){
		ans=ans%mod*ksm(ksm(i,i)%mod,(1+(n-i+1))*(n-i+1)/2)%mod;
	}
	printf("%lld\n",ans);
	return 0;
}