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

using mint = modint998244353;
const mint zero = 0, one = 1;

// 状態i->jに遷移する確率
const vector<vector<mint>> P = {
    {zero, one/5, one/5, one/5, one/5, one/5},
    {zero, one/2, one/2, zero , zero , zero },
    {zero, one/3, one/3, one/3, zero , zero },
    {zero, zero , one/3, one/3, one/3, zero },
    {zero, zero , zero , one/3, one/3, one/3},
    {zero, zero , zero , zero , one/2, one/2}
};

// 単位行列
const vector<vector<mint>> E = {
    {one, zero, zero, zero, zero, zero},
    {zero, one, zero, zero, zero, zero},
    {zero, zero, one, zero, zero, zero},
    {zero, zero, zero, one, zero, zero},
    {zero, zero, zero, zero, one, zero},
    {zero, zero, zero, zero, zero, one}
};

// 行列積
vector<vector<mint>> operator*(const vector<vector<mint>> &A, const vector<vector<mint>> &B) {
    int N = A.size();
    vector<vector<mint>> C(N, vector<mint>(N, 0));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            for (int k = 0; k < N; k++) {
                C[i][j] += A[i][k]*B[k][j];
            }
        }
    }
    return C;
}

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

    // 0: 初期状態, 1: 右, 2: 右上, 3: 上, 4: 左上, 5: 左
    vector<vector<mint>> dp(N+1, vector<mint>(6));

    // P^i, P^{i+1}
    vector<vector<mint>> Pi = E, Pi1 = P;

    for (int i = 0; i < N; i++) {
        for (int j = 1; j < 6; j++) {
            for (int k = 0; k < 6; k++) {
                // (i+1)日目の状態がjであるという条件のもとで、i日目の状態がkである確率
                mint pk = P[k][j]*Pi[0][k]/Pi1[0][j];
                // 1<j<5ならば高さが1増える
                dp[i+1][j] += (dp[i][k]+(1<j&&j<5))*pk;
            }
        }
        Pi = Pi1;
        Pi1 = Pi*P;
    }

    mint ans = 0;
    for (int i = 0; i < 6; i++) ans += dp[N][i]*Pi[0][i];
    cout << ans.val() << endl;
}