#include <bits/stdc++.h>
using namespace std;
#define int long long
//fixed << setprecision()
const int mod = 998244353;
int n;
int ans = 0;

long long binpow(long long a, long long b, long long m) 
{
	a %= m;
	long long res = 1;
    while (b > 0) 
	{
	    if (b & 1) res = res * a % m;
	    a = a * a % m;
	    b >>= 1;
  	}
  	return res;
}

/*
map<pair<int, int>, int> ccc;
map<pair<int, int>, bool> ccf;

int c(int n, int m)
{
	
	
	if(!ccf[{n, m}])
	{
		if(m == 0)
		{
			ccc[{n, m}] = 0;
		}
		else if(n == 0)
		{
			ccc[{n, m}] = 0;
		}
		else if(n == 1 && m == 1)
		{
			ccc[{n, m}] = 1;
		}
		else
		{
			ccc[{n, m}] = (c(n - 1, m) + c(n - 1, m - 1)) % mod;
		}
		ccf[{n, m}] = true;
	}
	return ccc[{n, m}];
}
*/
signed main()
{
	ios::sync_with_stdio(false);
	cin >> n;
	
	if(n == 1)
	{
		cout << 1 << endl;
		return 0;
	}
	
	int ans = 1;
	ans = binpow(10, n, mod);

	int kkk = mod - binpow(9, n, mod);
	cout << (ans + kkk) % mod << endl;
	

	return 0;
}