#include<stdio.h>
long long int a[2][2];
long long int res[2][2];
void modpow(long long int n, long long int p)
{
	res[0][0] = 1; res[0][1] = 0;
	res[1][0] = 0; res[1][1] = 1;
	int f[2][2];
	for (; n > 0; n /= 2)
	{
		if (n % 2 > 0)
		{
			f[0][0] = a[0][0] * res[0][0] % p + a[0][1] * res[1][0] % p;
			f[0][1] = a[0][0] * res[0][1] % p + a[0][1] * res[1][1] % p;
			f[1][0] = a[1][0] * res[0][0] % p + a[1][1] * res[1][0] % p;
			f[1][1] = a[1][0] * res[0][1] % p + a[1][1] * res[1][1] % p;
			res[0][0] = f[0][0] % p;
			res[0][1] = f[0][1] % p;
			res[1][0] = f[1][0] % p;
			res[1][1] = f[1][1] % p;
		}
		f[0][0] = a[0][0] * a[0][0] % p + a[0][1] * a[1][0] % p;
		f[0][1] = a[0][0] * a[0][1] % p + a[0][1] * a[1][1] % p;
		f[1][0] = a[1][0] * a[0][0] % p + a[1][1] * a[1][0] % p;
		f[1][1] = a[1][0] * a[0][1] % p + a[1][1] * a[1][1] % p;
		a[0][0] = f[0][0] % p;
		a[0][1] = f[0][1] % p;
		a[1][0] = f[1][0] % p;
		a[1][1] = f[1][1] % p;
	}
	return;
}
int main()
{
	long long int n;
	scanf("%lld", &n);
	const long long int p = 998244353;
	a[0][0] = 1; a[0][1] = 1;
	a[1][0] = 1; a[1][1] = 0;
	modpow(n - 1, p);
	long long int ans = res[0][0] + res[1][0] - 1;
	ans = (ans % p + p) % p;
	printf("%lld\n", ans);
	return 0;
}