#include<bits/stdc++.h>

using namespace std;

#define rep(i, l, r) for(int i = int(l); i < int(r); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

template<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}
template<class T> using spq = priority_queue<T, vector<T>, greater<T>>;

const int inf = 1000000009;
const long INF = 2000000000000000009;
const long double eps = 1e-10;
int dx[] = {0, 1, 0, -1, 1, -1, -1, 1}, dy[] = {1, 0, -1, 0, -1, -1, 1, 1};

#include<atcoder/modint>

using mint = atcoder::modint998244353;

void champignon() {
    int N; cin >> N;
    mint Ans = mint(N) * mint(N - 1) * mint(N - 2) * mint(N - 3) / mint(24);
    cout << (Ans * mint(26).pow(N - 4)).val() << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //cin >> T;
    while(T--) champignon();
}