#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

vector<vector<ll>> mul(vector<vector<ll>> A, vector<vector<ll>> B, ll mod){
    vector<vector<ll>> C((ll)A.size(), vector<ll>((ll)B[0].size(), 0));
    for(ll i=0; i<(ll)A.size(); i++){
        for(ll k=0; k<(ll)B.size(); k++){
            for(ll j=0; j<(ll)B[0].size(); j++){
                C[i][j] = (C[i][j]+A[i][k]*B[k][j])%mod;
            }
        }
    }
 
    return C;
}
 
vector<vector<ll>> mat_pow_mod(vector<vector<ll>> A, ll n, ll mod){
    ll siz = (ll)A.size();
    vector<vector<ll>> B(siz, vector<ll>(siz, 0));
    rep(i, siz) B[i][i] = 1;
    while(n > 0){
        if(n & 1) B = mul(B, A, mod);
        A = mul(A, A, mod);
        n >>= 1;
    }
 
    return B;
}

int main(){
    ll n;
    cin >> n;

    vector<vector<ll>> a(3, vector<ll>(3, 0));
    a[0][0]=1; a[0][1]=1; a[0][2]=0;
    a[1][0]=1; a[1][1]=0; a[1][2]=1;
    a[2][0]=0; a[2][1]=0; a[2][2]=1;
    a = mat_pow_mod(a, n-1, MOD2);
    cout << (a[0][2]+a[1][2])%MOD2 << endl;
}