#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define PII pair<int,int>
#define int long long
const int N=1e7+10;
const int INF=1e18;
namespace DEBUG {
template <typename T>
void _debug(const char* format, T t) {
  cerr << format << '=' << t << endl;
}
template <class First, class... Rest>
void _debug(const char* format, First first, Rest... rest) {
  while (*format != ',') cerr << *format++;
  cerr << '=' << first << ",";
  _debug(format + 1, rest...);
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& V) {
  os << "[ ";
  for (const auto& vv : V) os << vv << ", ";
  os << "]";
  return os;
}
#define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__)
}  // namespace DEBUG

using namespace DEBUG;
const int mod=998244353;
int jc[N],invjc[N];
int n;
int q_pow(int a, int k, int p) {
	int res = 1;
	while (k) {
		if (k & 1) res = res * a % p;
		a = a * a % p;
		k >>= 1;
	}
	return res;
}
void init()
{
    jc[0]=1;
    invjc[0]=1;
    for(int i=1;i<=n;i++)
    {
        jc[i]=jc[i-1]*i%mod;
        invjc[i]=invjc[i-1]*q_pow(i,mod-2,mod)%mod;
    }
}
int C(int a,int b)
{
    if(a<b)return 0;
    return jc[a]*invjc[b]%mod*invjc[a-b]%mod;
}
void solve()
{
	cin>>n;
	init();
	int sum=0;
	for(int i=1;i<=n;i++)
	{
		if(n-i<i-1)break;
		sum=(sum+(C(n-i,i-1)*jc[i-1]%mod*jc[n-i]%mod))%mod;
	}
	cout<<sum%mod<<endl;
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T=1;
//	cin>>T;
	while(T--)solve();
	return 0; 
}