#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using mint = atcoder::modint998244353;

#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define siz(x) (int)x.size()

#define debug(x) cout << #x << " : " << endl; for (auto u : x) cout << u << " "; cout << endl

template<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }

const int inf = 1e9;
const ll INF = 4e18;

template<class T> using spq = priority_queue<T, vector<T>, greater<T>>;

vector<int> di = {1, 0, -1, 0}, dj = {0, 1, 0, -1};

int main() {
    int n; cin >> n;
    mint N = n;
    mint ans = N * (N - 1) * (N - 2) * (N - 3) * mint(26).pow(n - 4) / 24;
    cout << ans.val() << "\n";
}