#include<bits/stdc++.h>

using lint = int64_t;
using namespace std;
const int mod = 998244353;

int minv(int a, lint m){
  a %= m; assert(a);
  return a == 1? 1 : int(m - int64_t(minv(m, a)) * m / a);
}

template<unsigned M_> struct modnum{
  static constexpr unsigned M = M_;
  using ll = int64_t; using ull = uint64_t; unsigned x;
  modnum& norm(unsigned a) { x = a < M ? a : a - M; return *this;}
  constexpr modnum (ll a = 0U) : x(unsigned((a %= ll(M))) < 0 ? a + ll(M) : a) {}
  explicit operator int () const {return x;}
  modnum & operator+= (const modnum& a) { return norm(x + a.x);}
  modnum & operator-= (const modnum& a) { return norm(x - a.x + M);}
  modnum & operator*= (const modnum& a) { x = unsigned(ull(x)*a.x % M); return *this;}
  modnum & operator/= (const modnum& a) { return (*this *= a.inv());}
  modnum operator+ (const modnum& a) { return (modnum(*this) += a);}
  modnum operator- (const modnum& a) { return (modnum(*this) -= a);}
  modnum operator* (const modnum& a) { return (modnum(*this) *= a);}
  modnum operator/ (const modnum& a) { return (modnum(*this) /= a);}
  template<typename T> friend modnum operator+(T a, const modnum &b) { return (modnum(a) += b);}
  template<typename T> friend modnum operator-(T a, const modnum &b) { return (modnum(a) -= b);}
  template<typename T> friend modnum operator*(T a, const modnum &b) { return (modnum(a) *= b);}
  template<typename T> friend modnum operator/(T a, const modnum &b) { return (modnum(a) /= b);}
  modnum operator+() const {return *this;}
  modnum operator-() const {return modnum() - *this;}
  modnum inv() const { return minv(x, M); }
  friend modnum inv(const modnum& a){return a.inv(); }
};

using num = modnum<mod>;

const int lim = 1e7 + 10;
num fac[lim], ifac[lim];
void prep(){
  fac[0] = 1;
  for(int i=1;i<lim;i++) fac[i] = fac[i-1] * i;
  ifac[lim-1] = fac[lim-1].inv();
  for(int i=lim-2;i>=0;i--) ifac[i] = ifac[i+1] * (i + 1);
}

int main(void) {
  cin.tie(nullptr)->sync_with_stdio(false);
  prep();
  int n;
  cin>>n;
  num ans = 0;
  for(int i=1;i<=n;i++){
    if(n - i < i - 1) break;
    ans += fac[n - i] * ifac[n - 2 * i + 1] * fac[n - i];
  }
  cout<<ans.x<<"\n";
  return 0;
}