#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define outl(x) cout << x << endl
#define SP << " " << 
#define inf 1e18
#define mod 998244353

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

ll n;
ll prime[1000005];
map<ll, P> mp;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	rep(i, 2, 1005){
		if(prime[i]) continue;
		for(int j = 2*i; j < 1000005; j+=i) prime[j] = i;
	}
	
	cin >> n;
	rep(i, 1, n){
		ll x = i; map<ll, ll> tmp;
		while(prime[x]){
			tmp[prime[x]]++;
			x /= prime[x];
		}
		if(x > 1) tmp[x]++;
		
		for(auto p : tmp){
			P q = mp[p.first];
			chmax(q.second, min(q.first, p.second));
			chmax(q.first, p.second);
			mp[p.first] = q;
		}
	}
	
	//for(auto q : mp) cout << q.first << " " << q.second.first << " " << q.second.second << endl;
	
	ll ans = 0, ans_i;
	rep(i, 1, n){
		ll x = i; map<ll, ll> tmp;
		while(prime[x]){
			tmp[prime[x]]++;
			x /= prime[x];
		}
		if(x > 1) tmp[x]++;
		
		ll mul = 1;
		for(auto p : tmp){
			P q = mp[p.first];
			if(q.second >= p.second) continue;
			rep(i, 1, p.second-q.second) mul *= p.first;
		}
		//cout << i << " " << mul << endl;
		if(ans < mul) ans = mul, ans_i = i;
	}
	
	//cout << ans_i << endl;
	
	mp.clear();
	rep(i, 1, n){
		if(i == ans_i) continue;
		ll x = i; map<ll, ll> tmp;
		while(prime[x]){
			tmp[prime[x]]++;
			x /= prime[x];
		}
		if(x > 1) tmp[x]++;
		
		for(auto p : tmp){
			P q = mp[p.first];
			chmax(q.second, min(q.first, p.second));
			chmax(q.first, p.second);
			mp[p.first] = q;
		}
	}
	
	//for(auto q : mp) cout << q.first << " " << q.second.first << " " << q.second.second << endl;
	
	ans = 1;
	for(auto p : mp){
		rep(i, 1, p.second.first) ans *= p.first, ans %= mod;
	}
	cout << ans << endl;
	
	return 0;
}