#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	string s; cin >> s;
	int sz = s.size();
	// 8の個数ちゃうんかい！！
	/*vector dp(2, vector<mint>(sz + 1));// ans
	vector sdp(2, vector<mint>(sz + 1));// cnt
	sdp[0][0] = 1;
	rep(i, sz) {
		int ni = i + 1;
		// 0->0
		int num = s[i] - '0';
		{
			dp[0][ni] += dp[0][i];
			sdp[0][ni] += sdp[0][i];
			if (num == 8)dp[0][ni]++;
		}
		// 0->1
		{
			rep(j, num) {
				dp[1][ni] += dp[0][i];
				sdp[1][ni] += sdp[0][i];
				if (j == 8)dp[1][ni] += sdp[0][i];
			}
		}
		// 1->1
		{
			rep(j, 10) {
				dp[1][ni] += dp[1][i];
				sdp[1][ni] += sdp[1][i];
				if (j == 8)dp[1][ni] += sdp[1][i];
			}
		}
	}
	rep(i, sz + 1) {
		rep(j, 2) {
			cout << dp[j][i].val() << " ";
		}cout << endl;
	}
	mint ans = 0;
	rep(i, 2)ans += dp[i][sz];
	cout << ans.val() << endl;*/
	vector dp(2, vector<mint>(sz + 1));// ans
	dp[0][0] = 1;
	rep(i, sz) {
		int ni = i + 1;
		// 0->0
		int num = s[i] - '0';
		if (num != 8) {
			dp[0][ni] += dp[0][i];
		}
		// 0->1
		{
			rep(j, num) {
				if (j == 8)continue;
				dp[1][ni] += dp[0][i];
			}
		}
		// 1->1
		{
			rep(j, 10) {
				if (j == 8)continue;
				dp[1][ni] += dp[1][i];
			}
		}
	}
	mint ans = 0;
	rep(i, sz)ans = ans * 10 + (s[i] - '0');
	ans++;
	rep(i, 2)ans -= dp[i][sz];
	cout << ans.val() << endl;
	return 0;
}