#include <bits/stdc++.h>
using namespace std;
#if __has_include("all.hpp")
#include "all.hpp"
#else
#include <atcoder/all>
#endif
using namespace atcoder;

using mint = modint998244353;
const int MOD = 998244353;

vector<long long> fact, fact_inv, inv;

void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}

long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

int main(void){
    int n;
    cin>>n;
    mint ans=1;
    mint c2=2,c5=5;
    init_nCk(1000);
    ans=ans/(c2.pow(n));
    mint tmp=0;
    for(int i=0;i<=n;i+=2){
        tmp+=nCk(n,i)*c5.pow(i);
    }
    ans*=tmp*2;
    cout<<ans.val()<<endl;
    return 0;
}