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

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N;
ll from[5];
ll to[5];
const ll mo=998244353;

ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	ll p5=modpow(5);
	cin>>N;
	ll ret=0;
	FOR(i,5) {
		from[i]=p5;
		if(i>=1&&i<=3) ret+=p5;
	}
	ret%=mo;
	for(x=2;x<=N;x++) {
		ZERO(to);
		
		FOR(i,5) {
			int cand=0;
			FOR(j,5) if(abs(i-j)<=1) cand++;
			FOR(j,5) if(abs(i-j)<=1) {
				(to[j]+=from[i]*modpow(cand))%=mo;
				if(j>=1&&j<=3) (ret+=from[i]*modpow(cand))%=mo;
			}
		}
		swap(from,to);
	}
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}