#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

using mint = atcoder::modint998244353;

void solve() {
	string s;
	cin >> s;
	int n = s.size();
	vector<mint> dp(2, 0), ans(2, 0);
	dp[1] = 1;
	rep(i, 0, n) {
		int k = s[i] - '0';
		ans[0] = ans[0] * 10 + ans[1] * k;
		if (k > 8) {
			ans[0] += dp[0] + dp[1];
			dp[0] = dp[0] * 9 + dp[1] * (k - 1);
		} else if (k == 8) {
			ans[0] += dp[0];
			ans[1] += dp[1];
			dp[0] = dp[0] * 9 + dp[1] * k;
			dp[1] = 0;
		} else {
			ans[0] += dp[0];
			dp[0] = dp[0] * 9 + dp[1] * k;
		}
	}
	cout << (ans[0] + ans[1]).val() << "\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}