#include <iostream>
#include <vector>

using namespace std;

constexpr long long mod = 998244353;

vector<vector<long long>> mul(const vector<vector<long long>> &x, const vector<vector<long long>> &y) {
    int n, m, l;
    n = x.size();
    m = y.size();
    l = y[0].size();

    vector<vector<long long>> res(n, vector<long long>(l, 0LL));

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            for (int k = 0; k < l; k++) {
                res[i][k] += (x[i][j] * y[j][k]) % mod;
                res[i][k] %= mod;
            }
        }
    }

    return res;
}

vector<vector<long long>> pow(const vector<vector<long long>> &v, long long p) {
    int sz = v.size();
    vector<vector<long long>> res(sz, vector<long long>(sz, 0));
    vector<vector<long long>> x = v;
    for (int i = 0; i < sz; i++) {
        res[i][i] = 1LL;
    }

    while (p > 0) {
        if (p & 1) {
            res = mul(res, x);
        }
        p >>= 1;
        x = mul(x, x);
    }

    return res;
}

int main() {
    long long n;
    cin >> n;
    vector<vector<long long>> init = {
        {0},
        {1},
        {0},
        {0}
    };
    vector<vector<long long>> p = {
        {0, 1, 0, 0},
        {1, 1, 0, 0},
        {1, 0, 0, 0},
        {0, 1, 0, 0}
    };

    vector<vector<long long>> ans = mul(pow(p, n - 1), init);

    cout << ((ans[0][0] + ans[1][0] - 1) % mod) << endl;
}