#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'
const ll MOD = 998244353;

int main(){
    cin.tie(0)->sync_with_stdio(0);

    ll n;
    cin >> n;

    vector<ll> B(2, 0);
    B[0] = 1;
    vector<vector<ll>> A(2, vector<ll>(2, 1));
    A[1][1] = 0;
    n--;
    while(n > 0){
        if(n & 1){
            vector<ll> C(2, 0);
            for(int i = 0; i < 2; i++) for(int j = 0; j < 2; j++){
                C[i] += A[i][j] * B[j] % MOD;
                C[i] %= MOD;
            }
            swap(B, C);
        }
        vector<vector<ll>> C(2, vector<ll>(2, 0));
        for(int i = 0; i < 2; i++) for(int j = 0; j < 2; j++){
            for(int k = 0; k < 2; k++){
                C[i][j] += A[i][k] * A[k][j] % MOD;
                C[i][j] %= MOD;
            }
        }
        swap(A, C);
        n >>= 1;
    }
    ll ans = B[0] + B[1] - 1;
    ans = (ans % MOD + MOD) % MOD;
    cout << ans << endl;
}