#include <bits/stdc++.h>
using namespace std;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

using Vec = vector<mint>;
using Mat = vector<vector<mint>>;
Mat dot(const Mat& A, const Mat& B) {
    const int64_t n = A.size();
    const int64_t m = A[0].size();
    assert(m == B.size());
    const int64_t l = B[0].size();
    Mat result(n, Vec(l, 0));
    for (int64_t i = 0; i < n; i++) {
        for (int64_t j = 0; j < l; j++) {
            for (int64_t k = 0; k < m; k++) {
                result[i][j] += A[i][k] * B[k][j];
            }
        }
    }
    return result;
}

int main() {
    int64_t N;
    cin >> N;
    N--;

    Mat A(2, Vec(2));
    A[0][0] = 1;
    A[0][1] = 1;
    A[1][0] = 1;
    A[1][1] = 0;

    Mat r(2, Vec(2, 0));
    r[0][0] = r[1][1] = 1;

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

        A = dot(A, A);
        N /= 2;
    }

    Mat init(2, Vec(1, 0));
    init[0][0] = 1;
    const Mat final_vec = dot(r, init);
    const mint ans = final_vec[0][0] + final_vec[1][0] - 1;
    cout << ans.val() << endl;
}