#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>> to = {
		{0,1},
		{0,1,2},
		{1,2,3},
		{2,3,4},
		{3,4}
	};
	vector<int>add = { 0,1,1,1,0 };
	vector dp(n, vector<pair<mint, mint>>(5));
	mint inv2 = mint::raw(2).inv();
	mint inv3 = mint::raw(3).inv();
	mint inv5 = mint::raw(5).inv();
	vector<mint>ps = { inv2,inv3,inv3,inv3,inv2 };
	dp[0][0] = { inv5,0 };
	dp[0][1] = { inv5,inv5 };
	dp[0][2] = { inv5,inv5 };
	dp[0][3] = { inv5,inv5 };
	dp[0][4] = { inv5,0 };
	rep(i, n - 1) {
		rep(j, 5) {
			mint p = ps[j];
			for (auto k : to[j]) {
				mint nf = dp[i][j].first * p;
				mint ns = dp[i][j].second * p + nf * add[k];
				dp[i + 1][k].first += nf;
				dp[i + 1][k].second += ns;
			}
		}
	}
	mint ans = 0;
	rep(i, 5)ans += dp[n - 1][i].second;
	cout << ans.val() << endl;
	return 0;
}