#include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0(){}; template<typename H,typename... T> void print0(H h,T... t){cout<<h;print0(t...);}
void print(){print0("\n");}; template<typename H,typename... T>void print(H h,T... t){print0(h);if(sizeof...(T)>0)print0(" ");print(t...);}
void perr0(){}; template<typename H,typename... T> void perr0(H h,T... t){cerr<<h;perr0(t...);}
void perr(){perr0("\n");}; template<typename H,typename... T>void perr(H h,T... t){perr0(h);if(sizeof...(T)>0)perr0(" ");perr(t...);}
void ioinit() { cout<<fixed<<setprecision(15); cerr<<fixed<<setprecision(6); ios_base::sync_with_stdio(0); cin.tie(0); }
#define debug1(a) { cerr<<#a<<":"<<a<<endl; }
#define debug2(a,b) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<endl; }
#define debug3(a,b,c) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<endl; }
#define debug4(a,b,c,d) { cerr<<#a<<":"<<a<<" "<<#b<<":"<<b<<" "<<#c<<":"<<c<<" "<<#d<<":"<<d<<endl; }
// clang-format on
const ll MODULO = 998244353;
using T = ll;
class matrix {
   public:
    ll row;
    ll col;
    vector<vector<T>> mat;
    matrix(ll r, ll c) {
        row = r;
        col = c;
        mat = vector<vector<T>>(r, vector<T>(c));
    }
    void set(ll r, ll c, T v) {
        mat[r][c] = v;
    }
    void setvec(vector<vector<T>>& v) {
        mat = v;
    }
    T get(ll r, ll c) {
        return mat[r][c];
    }
    matrix add(matrix& rhs) {
        auto result = matrix(row, col);
        for (ll i = 0; i < row; i++) {
            for (ll j = 0; j < col; j++) {
                result.mat[i][j] = (mat[i][j] + rhs.mat[i][j]) % MODULO;
            }
        }
        return result;
    }
    matrix mult(matrix& rhs) {
        /*
             S行*T列  * T行*U列  =>  S行*U列
            [ 1 2 3    [ 10      [1*10+2*30+3*50    [220
              4 5 6] *   30   =   4*10+5*30+6*50] =  490 ]
                         50 ]
            O(STU)  とくに正方行列なら O(S^3)
        */
        ll s = row;
        ll t = col;
        ll u = rhs.col;
        assert(rhs.row == t);
        auto result = matrix(s, u);
        for (ll i = 0; i < s; i++) {
            for (ll j = 0; j < u; j++) {
                for (ll k = 0; k < t; k++) {
                    result.mat[i][j] = (result.mat[i][j] + mat[i][k] * rhs.mat[k][j]) % MODULO;
                }
            }
        }
        return result;
    }
    matrix matpow(ll n) {
        // O(S^3 logN)
        assert(row == col);
        if (n == 0) {
            return unit(row);
        }
        auto half = matpow(n / 2);
        auto result = half.mult(half);
        if (n % 2) {
            result = result.mult(*this);
        }
        return result;
    }
    matrix unit(ll n) {
        auto u = matrix(n, n);
        for (ll i = 0; i < n; i++) {
            u.set(i, i, 1);
        }
        return u;
    }
};

int main() {
    ioinit();
    ll N;
    cin >> N;
    vector<ll> tbl = {0, 0, 1, 2};
    if (N < tbl.size()) {
        print(tbl[N]);
        return 0;
    }
    auto mat = matrix(2, 2);
    mat.set(0, 0, 1);
    mat.set(0, 1, 1);
    mat.set(1, 0, 1);
    mat.set(1, 1, 0);
    auto fib = mat.matpow(N);

    ll ans = fib.get(0, 0) - 1;
    if (ans < 0) ans += MODULO;
    print(ans);
    return 0;
}