//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define MOD 998244353
using namespace __gnu_pbds;
using namespace std;

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

long long n,a[700010],f[700010];

int base,cnt,vis[350010],pri[350010],dp[700010];

inline void add1(int &x,int y)
{
	x+=y;
	if(x>=MOD) x-=MOD;
}

inline void add2(int &x,int y)
{
	x+=y;
	if(x<0) x+=MOD;
}

inline int my_pow(int x,long long y)
{
	if(y==0) return 1;
	if(y==1) return x;
	int res=my_pow(x,y/2);
	if(y%2==0) return 1ll*res*res%MOD;
	else return 1ll*res*res%MOD*x%MOD;
}

inline int id(long long x)
{
	if(x<=base) return x;
	return 2*base+1-n/x;
}

inline void init()
{
	for(int i=2;i<=base;i++){
		if(!vis[i]) pri[++cnt]=i;
		for(int j=1;j<=cnt&&i*pri[j]<=base;j++){
			vis[i*pri[j]]=1;
			if(i%pri[j]==0) break;
		}
	}
	for(int i=1;i<=base;i++) a[i]=i;
	for(int i=1;i<=base;i++) a[2*base+1-i]=n/i;
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;base=(int)sqrtl(n);init();
	for(int i=1;i<=2*base;i++) f[i]=a[i]-1;
	int pos=1;
	for(int i=1;i<=cnt;i++){
		while(1ll*pri[i]*pri[i]>a[pos]) pos++;
		for(int j=2*base;j>=pos;j--){
			f[j]-=f[id(a[j]/pri[i])]-(i-1);
		}
	}
	int ans=1;
	for(long long i=1,j;i<=n;i=j+1){
		j=n/(n/i);
		long long len=j-i+1,tot=n/i;
		if(tot<=2) continue;
		long long num=f[id(n/i)]-f[id(n/i/2)]+1;
		if(tot==3) num--;
		int cur=1ll*my_pow(tot%MOD,num-1)*((tot-num)%MOD)%MOD;
		ans=1ll*ans*my_pow(cur,len)%MOD;
	}
	cout<<ans<<'\n';
	return 0;
}