#include<iostream>
#include<algorithm>
using namespace std;
#define int long long 
const int N=200010;
const int mod=998244353;
int qmi(int a,int b)
{
	int res=1;
	while(b)
	{
		if(b&1)
			res=res*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return res;
}
int dp[200010];
int s0[200010];
int s1[200010];
signed main()
{
	int t;
	dp[0]=1;
	//s0[0]=1;
	// 奇数  dp0 + dp2 + dp4 + dp6
	for(int i=1;i<=200000;i++)
	{
		if(i%2)
		dp[i]=(s0[i-1]+1)%mod;
		else
		dp[i]=(s1[i-1])%mod;
		s1[i]=s1[i-1];
		s0[i]=s0[i-1];	
		if(i%2)
		s1[i]=(s1[i]+dp[i])%mod;
		else
		s0[i]=(s0[i]+dp[i])%mod;
	}
		int n;
		cin>>n;
		int tmp=dp[n]*qmi(qmi(2,n),mod-2)%mod;
		cout<<tmp<<endl;	
}