#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  if (n <= 2) {
    cout << 1 << '\n';
    return 0;
  }
  vector<mint> fib(n + 1);
  fib[1] = 1, fib[2] = 1;
  for (int i = 3; i <= n; i++) fib[i] = fib[i - 1] + fib[i - 2];
  cout << fib[n].val() << "\n";
  return 0;
}