#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

typedef unsigned long long ull;

const int N=1001000;
ull S,n;
bool pr[N];
int m,p[N],tot,_;
ull h[N],num[N],k;
int getid(ull x) {
	return x<=S?x-1:m-n/x;
}
ull ff(ull n) {
	return 1;
}
ull sumf(ull n) { // return 2..n f[i]
	return n-1;
}

void solve(ull n) {
	S=sqrt(n);
	while (S*S<=n) ++S;
	while (S*S>n) --S;
	m=0;
	rep(i,1,S+1) num[m++]=i;
	per(i,1,S+1) if (n/i>S) num[m++]=n/i;

	// find prime ^k
	rep(i,0,m) h[i]=sumf(num[i]);
	int it=0;
	ull y=0;
	rep(p,2,S+1) if (h[p-1]!=h[p-2]) {
		while (num[it]<(ll)p*p) ++it;
		per(i,it,m) h[i]=h[i]-ff(p)*(h[getid(num[i]/p)]-y);
		y+=ff(p);
	}
	// h = 2..n f[p]
	ll ans=1;
	for (ll l=1;l<=n;l+=1) {
		ll d=n/l,r=n/d;
		ll way=1;
		if (d>=2) {
			ll c=h[getid(d)]-h[getid(d/2)]+1;
			if (d==c) {
				way=powmod(d,d-2);
			} else {
				way=(d-c)%mod*powmod(d,c-1)%mod;
			}
		}
		//printf("!! %lld %lld\n",d,way);
		ans=ans*powmod(way,r-l+1)%mod;
		l=r;
	}
	printf("%lld\n",ans);
}

int main() {
	scanf("%llu",&n);
	int M=700000;
	for (int i=2;i<=M;i++) if (!pr[i]) {
		p[tot++]=i;
		for (int j=i;j<=M;j+=i) pr[j]=1;
	}
	solve(n);
}