#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 998244353;

ll p10[900000], p9[900000];

int main(void) {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	p10[0] = 1;
	for(int i = 1; i < 900000; ++i) p10[i] = (p10[i - 1] * 10) % mod;
	p9[0] = 1;
	for(int i = 1; i < 900000; ++i) p9[i] = (p9[i - 1] * 9) % mod;
	
	string N;
	cin >> N;
	int T = N.size();
	
	ll ans = 0;
	bool flag = 0;
	for(int i = 0; i < T; ++i) {
		if(flag) ans = (ans + (N[i] - '0') * p10[T - i - 1] % mod) % mod;
		else {
			for(int j = 0; j < (N[i] - '0'); ++j) {
				if(j == 8) ans = (ans + p10[T - i - 1]) % mod;
				else ans = (ans + p10[T - i - 1] - p9[T - i - 1] + mod) % mod;
			}
		}
		if(N[i] == '8') flag = 1;
	}
	
	if(flag) ans = (ans + 1) % mod;
	
	cout << ans << endl;
	return 0;
}