#include <bits/stdc++.h>
#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
#include<string>
using ll = long long;
using namespace std;

ll mpow(ll x, ll y, ll mod){
    ll ans = 1;
    while (y){
        if (y & 1) ans = ans * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return ans;
}

int main()
{
    ll n, t = 1, mod = 998244353;
    cin >> n;
    if (n == 1) cout << 1 << endl;
    else cout << mpow(6, n/2, mod) << endl;
}