// Problem: B - Squares
// Contest: AtCoder - AtCoder Regular Contest 125
// URL: https://atcoder.jp/contests/arc125/tasks/arc125_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef unsigned long long ull;
#define x first
#define y second
#define sf scanf
#define pf printf
#define PI acos(-1)
#define inf 0x3f3f3f3f
#define lowbit(x) ((-x)&x)
#define mem(a,x) memset(a,x,sizeof(a))
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<=(b);++i)
#define repr(i,b,a) for(int i=int(b);i>=(a);--i)
#define debug(x) cout << #x <<": " << x << endl;
const int MOD = 998244353;
const int mod = 998244353;
const int maxn = 2e5 + 10;
const int dx[] = {0, 1, -1, 0, 0};
const int dy[] = {0, 0, 0, 1, -1};
const int dz[] = {1, -1, 0, 0, 0, 0 };
int day[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
void init(){
}
ll n;
void solve()
{
ll ans=0;
cin>>n;
for(ll i=1;;i++){
ll j=n/i;
if(j==i){
ans+=j;
ans=ans%mod;
break;
}
if(j<i){
ans+=(i-1);
ans=ans%mod;
break;
}
ans+=(j-i)/2;
ans=ans%mod;
}
cout<<ans<<endl;
}
int main()
{
init();
ll t = 1;
//scanf("%lld",&t);
while(t--)
{
solve();
}
return 0;
}