#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y))
#define chmax(x,y) x = max((x),(y))
#define popcount(x) __builtin_popcount(x)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
//const int MOD = 1000000007;
const int MOD = 998244353;
const double PI = 3.14159265358979323846;

long long modpow(long long x, long long n,long long m) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = (ret * x) % m;  
        x = (x * x) % m;
        n >>= 1;  
    }
    return ret;
}

int main(){
    ll n;
    cin >> n;
    cout << modpow(6,n/2,MOD) << endl;
    return 0;
}