#include <bits/stdc++.h>

#define N 7
#define M 998244353

struct matrix
{
    int v[N][N];

    matrix(bool d = false)
    {
        memset(v, 0, sizeof v);

        if (d)
            for (int i = 0; i < N; i++)
                v[i][i] = 1;
    }

    matrix operator*(const matrix &m) const
    {
        auto r = matrix();

        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++)
                for (int k = 0; k < N; k++)
                    r.v[i][j] = (r.v[i][j] + (long long)v[i][k] * m.v[k][j] % M) % M;

        return r;
    }

    matrix operator^(long long e) const
    {
        auto r = matrix(true);

        for (auto m = *this; e; e >>= 1, m = m * m)
            if (e & 1)
                r = r * m;

        return r;
    }
} g;

long long n;

int main()
{
    scanf("%lld", &n);

    if (n == 1)
    {
        puts("45");
        return 0;
    }

    g.v[0][1] = g.v[0][3] = g.v[0][5] = 1;
    g.v[1][1] = 99; g.v[1][2] = M - 765;
    g.v[2][1] = 1;
    g.v[3][0] = g.v[3][3] = g.v[3][4] = 9;
    g.v[4][3] = 1;
    g.v[5][2] = g.v[5][5] = 9; g.v[5][6] = 18;
    g.v[6][5] = 1;
    g = g ^ (n - 1);

    int v[N] = {45, 4455, 45, 0, 0, 0, 0}, r = 0;
    for (int i = 0; i < N; i++)
        r = (r + (long long)g.v[0][i] * v[i] % M) % M;

    printf("%d\n", r);
    return 0;
}