#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

const ll modc = 998244353;

vector<vector<ll>> dot(vector<vector<ll>> &a, vector<vector<ll>> &b){
    vector<vector<ll>> c(2, vector<ll>(2));
    for (int i=0; i<2; i++){
        for (int k=0; k<2; k++){
            for (int j=0; j<2; j++){
                c[i][j] += (a[i][k] * b[k][j]) % modc;
                c[i][j] %= modc;
            }
        }
    }
    return c;
}

int main(){

    ll N;
    cin >> N;
    if (N == 2){
        cout << 1 << endl;
        return 0;
    }
    N -= 2;
    vector<vector<ll>> A = {{1,1},{1,0}}, B={{1,0},{0,1}};

    while(N){
        if (N % 2 == 1) B = dot(A, B);
        N >>= 1;
        A = dot(A, A);
    }

    cout << (modc + B[0][0] * 2 + B[0][1] - 1) % modc << endl; 

    return 0;
}