#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

int n;
unordered_map<int,ll> dp;
const int M=20210926;
ll calc(int n) {
	if (dp.count(n)) return dp[n];
	ll x=1;
	for (int l=2;l<=n&&l<=M;l++) {
		int d=n/l,r=min(M,n/d);
		x=(x+calc(d)*(r-l+1))%mod;
		l=r;
	}
	return dp[n]=x;
}

int main() {
	scanf("%d",&n);
	printf("%lld\n",calc(n));
}