#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int MOD = 1000000007;
const int MOD = 998244353;
struct mint {
	ll x;
	mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
	mint operator-() { return mint(-x); }
	mint operator+=(mint rhs) {
		x += rhs.x;
		if (x >= MOD) x -= MOD;
		return *this;
	}
	mint operator-=(mint rhs) {
		x -= rhs.x;
		if (x < 0) x += MOD;
		return *this;
	}
	mint operator*=(mint rhs) {
		x = x * rhs.x % MOD;
		return *this;
	}
	mint operator+(mint rhs) { return mint(*this) += rhs; }
	mint operator-(mint rhs) { return mint(*this) -= rhs; }
	mint operator*(mint rhs) { return mint(*this) *= rhs; }
	mint pow(ll n) {
		mint r = 1;
		for (mint t = (*this); n; t *= t, n >>= 1)
			if (n & 1) r *= t;
		return r;
	}
	mint inv() { return (*this).pow(MOD - 2); }
	mint operator/=(mint rhs) { return *this *= rhs.inv(); }
	mint operator/(mint rhs) { return mint(*this) /= rhs; }
};
ostream &operator<<(ostream &os, const mint &dt) {
	os << dt.x;
	return os;
}
int main() {
	int n;
	cin >> n;
	vector<mint> memo(n + 2);
	vector<bool> vis(n + 2, false);
	auto f = [&](auto self, int x) -> mint {
		if (x == 1 || x == 2) return 1;
		if (vis[x]) return memo[x];
		mint r = self(self, x - 1) + self(self, x - 2);
		memo[x] = r;
		vis[x] = true;
		return r;
	};
	cout << f(f, n) << endl;
	return 0;
}