#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/all>
using namespace atcoder;




using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}


int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N;
    cin>>N;
    prenCkModp(N);
    mint an=0;
    mint d=mint(25).pow(N);
    mint iv=mint(25).inv();
    for(int j=0;j<=N;j++){
        an+=d*nCk(N,j)*(j/3);
        d*=iv;
    }
    cout<<an.val()<<endl;
}