//D
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
using ll = long long;
#define ALL(a)  (a).begin(),(a).end()
using v_vll = vector<vector<ll>>;
const ll mod=998244353;
v_vll matrix_mult(v_vll a,v_vll b){
    v_vll ret(a.size(),vector<ll> (b[0].size()));
    for(ll i=0;i<a.size();i++){
        for(ll j=0;j<b[0].size();j++){
            for(ll k=0;k<b.size();k++){
                ret[i][j]+=(a[i][k]*b[k][j])%mod;
            }
        }
    }
    return ret;
}
v_vll matrix_pow(v_vll a,ll n){
    v_vll ret(a.size(),vector<ll>(a.size()));
    for(ll i=0;i<a.size();i++){
        ret[i][i]=1;
    }
    while(n>0){
        if(n&1){
            ret=matrix_mult(a,ret);
        }
        a=matrix_mult(a,a);
        n>>=1;
    }
    return ret;
}
ll f(ll n){
    v_vll a={
        {1,1},
        {1,0}
    };
    a=matrix_pow(a,n);
    ll nth,nm2th;
    nth=a[1][0];
    return nth;
}
int main(){
    //一旦愚直DP書いてみるか
    ll n;cin>>n;
    
    //cout<<nm2th<<endl;
    cout<<(f(n)%mod+f(n-1)%mod-1)%mod<<endl;
    //くり返し二乗法
    //vector<vector<ll>> dp(n+10,vector<ll> (2));
    //dp[1][0]=1;
    /*for(ll i=2;i<=n;i++){
        dp[i][0]=(dp[i-1][0]+dp[i-1][1])%998244353;
        dp[i][1]=dp[i-1][0]%998244353;
    }*/
    /*cout<<"fast"<<endl;
    cout<<f(n)%mod<<" "<<f(n-1)%mod<<endl;
    cout<<"slow"<<endl;
    cout<<dp[n][0]<<" "<<dp[n][1]<<endl;*/
    /*for(ll i=1;i<=n;i++){
        cout<<dp[i][0]<<" ";
    }cout<<endl;
    for(ll i=0;i<=n;i++){
        cout<<dp[i][1]<<" ";
    }cout<<endl;*/
    //cout<<(dp[n][0]+dp[n][1]-1)%998244353<<endl;
}