/**
	author:  shobonvip
	created: 2025.08.22 21:00:35
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	string n; cin >> n;
	vector<int> a;
	for (char c: n) {
		a.push_back(c - '0');
	}

	vector<mint> dp(2);
	int tar = 0;
	rep(num,0,(int)a.size()) {
		vector<mint> ndp(2);

		// keizoku
		ndp[0] += dp[0] * 9;
		ndp[1] += dp[0];
		ndp[1] += dp[1] * 10;

		// shinki
		if (num > 0) {
			ndp[0] += 8;
			ndp[1] += 1;
		}

		// kaihou
		for (int i=int(num < 1); i<a[num]; i++) {
			if (i==8 || tar==1) ndp[1] += 1;
			else ndp[0] += 1;
		}

		if (a[num] == 8) tar = 1;

		swap(dp, ndp);
	}
	
	if (tar == 1) dp[1] += 1;

	cout << dp[1].val() << endl;
}