using namespace std;
#include "bits/stdc++.h"

#define REP(a, b) for (long long a = 0; a < b; ++a)
#define ALL(a) begin(a), end(a)

#include "atcoder/modint.hpp"
using mint = atcoder::modint998244353;

#define ld long double
#define int long long

map<int, mint> dp;
mint f(int x)
{
  if (dp.count(x))
    return dp[x];
  return dp[x] = f(x - 1) + f(x - 2);
}

void solve()
{
  dp[1] = 1;
  dp[2] = 1;
  int n;
  cin >> n;
  cout << (f(n + 1) - 1).val() << endl;
}

#undef int

int main()
{
  // Fasterize input/output script
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(100);

  int t = 1;
  // cin >> t; // comment out if solving multi testcase
  for (int testCase = 1; testCase <= t; ++testCase)
  {
    solve();
  }
  return 0;
}