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

const ll mod = 998244353; 

ll m,n,res,v;

ll ksm(ll x,ll p){
	ll ans=1,base=x;
	while(p!=0){
		if(p&1)ans=(ans%mod*base%mod)%mod;
		base=(base%mod*base%mod)%mod;
		p=p>>1;
	}
	return ans;
}

int main(){
	freopen("X.in","r",stdin); 
	freopen("X.out","w",stdout);
	scanf("%lld",&n);
	if(n%2){
		res=ksm(2,n+1);
		res-=1;
		res=(res%mod*ksm(3,mod-2)%mod)%mod;
	}else{
		res=ksm(2,n+1);
		res-=2;
		res=(res%mod*ksm(3,mod-2)%mod)%mod;
	}
	printf("%lld\n",res);
	return 0;
}