#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define quick ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int inf = 0x3f3f3f3f, maxn = 2e5 + 5, mod = 998244353;
inline int read() {
    int s = 0, w = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')w = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')s = s * 10 + ch - '0', ch = getchar();
    return s * w;
}
void solve() {
    int n;n=read();
    vector<int>dp(n+1);
    dp[1]=1,dp[2]=1;
    for(int i=3;i<=n;i++){
        dp[i]=dp[i-1]+dp[i-2];
        dp[i]%=mod;
    }
    cout<<dp[n]%mod<<endl;
}
signed main() {
    int t = 1;
//  cin>>t;
    while (t--) {
        solve();
    }
    return 0;
}
/*
请注意，我这里想的是当n=0使没有意义，因为所以初始化时我考虑从dp[1]开始而非dp[0]
*/