#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef pair<int,int>PII;
const int N=1e7+100,INF=4e18,P=998244353;
int n,m;
int q[N],ni[N];
int qmi(int a,int b,int P)
{
	int res=1;
	while(b)
	{
		if(b&1)res=res*a%P;
		a=a*a%P;
		b>>=1;
	}
	return res;
}
void init(int n)
{
	int now=1;
	for(int i=1;i<=n;i++)
	{
		now*=i;
		now%=P;
		q[i]=now;
		ni[i]=qmi(q[i],P-2,P);
	}
	return;
}
void solve()
{
	int n;
	cin>>n;
	init(n);
	int res=0;
	q[0]=1;
	if(n==1){cout<<1;return;}
	for(int i=1;i<=(n+1)/2;i++)
	{
		res+=(q[n-i]*q[n-i]%P*ni[n-2*i+1])%P;
		res%=P;
	}
	cout<<res;
}
signed main()
{
	IOS;
	int T=1;
	//cin>>T;
	while(T--)
		solve();
	return 0;
}