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

const int maxn = 2e5+5, mod = 998244353;
inline int add(int x, int y) { return (x+y) % mod; }
inline int mul(int x, int y) { return (1ll * x * y) % mod; }

int n, dp[maxn], pre[2][maxn];

int fpow(int a, int b) {
	int res = 1;
	while(b > 0) {
		if (b&1) res = mul(res, a);
		a = mul(a, a);
		b >>= 1;
	}
	return res;
}

int main(){
	scanf("%d", &n);
	dp[0] = pre[0][0] = 1;
	for(int i = 1; i<=n; i++) {
		bool cur = i&1;
		dp[i] = pre[cur^1][i-1];
		pre[cur][i] = add(pre[cur][i-1], dp[i]);
		pre[cur^1][i] = pre[cur^1][i-1];
	}
	int inv = fpow(fpow(2,n), mod-2);
	printf("%d\n", mul(dp[n], inv));
	return 0;
}
