#include <iostream>
using namespace std;

const long long MOD = 998244353;

// Function to compute (base^exp) % mod
long long mod_pow(long long base, long long exp, long long mod) {
    long long result = 1;
    while (exp > 0) {
        if (exp % 2 == 1) {
            result = (result * base) % mod;
        }
        base = (base * base) % mod;
        exp /= 2;
    }
    return result;
}

int main() {
    long long n;
    cin >> n;
    
    // The number of "perfect" graphs with n vertices is 2^(n-1)
    // We need to calculate 2^(n-1) % 998244353
    long long result = mod_pow(2, n - 1, MOD);
    
    cout << result << endl;
    
    return 0;
}