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

class mint{
private:
    inline static ll mod = 998244353;
    static const int binom_n = 3000001;
    ll val;
public:
    inline static ll fact[binom_n],finv[binom_n],inver[binom_n];
    static void set_mod(ll m){
        mod = m;
    }
    /// @brief O(n)
    static void init(){
        fact[0] = fact[1] = 1;
        finv[0] = finv[1] = 1;
        inver[1] = 1;
        for (int i = 2; i < binom_n; i++){
            fact[i] = fact[i - 1] * i % mod;
            inver[i] = mod - inver[mod%i] * (mod / i) % mod;
            finv[i] = finv[i - 1] * inver[i] % mod;
        }
    }
    /// @brief O(1)
    static mint binom(ll n,ll r){
        if(n < r)return 0;
        if(n < 0 || r < 0)return 0;
        return mint(fact[n] * (finv[r] * finv[n-r] % mod) %mod);
    }
    static mint fac(ll n){
        return fact[n];
    }
    static mint fac_inv(ll n){
        return finv[n];
    }
    mint(ll v = 0) : val((v%mod + mod)%mod){}
    const ll operator*() const {
        return val;
    }
    const bool operator==(const mint &a){
        return (val == *a);
    }
    const bool operator!=(const mint &a){
        return (val != *a);
    }
    mint& operator+=(const mint& a){
        if((val += *a) >= mod) val -= mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((val += mod-*a) >= mod)val -= mod;
        return *this;
    }
    mint& operator*=(const mint& a){
        (val *= *a) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res *= inv(a);
    }
    /// @brief O(log n)
    static mint pow(mint a,ll n){
        ll _a = *a, _n = n;
        ll res = 1;
        while(_n > 0){
            if(_n&1)res = res*_a %mod;
            _a = _a*_a %mod;
            _n = _n>>1;
        }
        return mint(res);
    }
    /// @brief O(log mod)
    static mint inv(mint n){
        ll a = *n;
        ll b = mod,u = 1,v=0;
        while(b){
            ll t = a/b;
            a -= t*b;swap(a,b);
            u -= t*v;swap(u,v);
        }
        u%=mod;
        if(u<0)u += mod;
        return mint(u);
    }

};
mint operator"" _m(unsigned long long val){return mint(val);}
istream& operator>>(istream& is, mint& x){ ll v; is >> v; x = v; return is; }

int main(){
    mint::init();
    ll n;
    cin >> n;
    cout << *(mint::binom(n,4) * mint::pow(26,max(0ll,n-4))) << endl;
}