#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

char *p1, *p2, buf[1048577];
#define gc (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++)
template <typename T>
inline void Read(T &x)
{
	x = 0;
	char ch = gc;
	while (!isdigit(ch)) ch = gc;
	while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = gc;
}

typedef long long ll;
const int maxn = 5005;
const ll mod = 998244353;

ll fpow(ll a, ll b)
{
	ll ans = 1;
	while (b)
	{
		if (b & 1) ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);

	int N;
	cin >> N;
	cout << (fpow(2, N) + mod - 1 - N) % mod;
	return 0;
}