#include <bits/stdc++.h>

#include <atcoder/all>

using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
static const ll INF = ll_max / 10;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

using namespace atcoder;
using mint = modint998244353;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	string s;
	cin >> s;
	// keta dp
	// i番目まで見て j == 1で桁通りで，k == 1で8をすでに含んだ
	// vector dp(s.size(), vector(2, vector(2, mint(0))));
	vector<vector<vector<mint>>> dp(s.size(), vector<vector<mint>>(2, vector<mint>(2, 0)));
	rep(i, s[0] - '0')
	{
		dp[0][0][i == 8] += 1;
	}
	dp[0][1][s[0] == '8'] += 1;
	rep_(i, 1, s.size())
	{
		// 桁未満 -> 桁未満
		rep(j, 10)
		{
			if (j == 8)
			{
				dp[i][0][1] += dp[i - 1][0][0] + dp[i - 1][0][1];
			}
			else
			{
				dp[i][0][1] += dp[i - 1][0][1];
				dp[i][0][0] += dp[i - 1][0][0];
			}
		}

		// 桁通り -> 桁未満
		rep(j, s[i] - '0')
		{
			if (j == 8)
			{
				dp[i][0][1] += dp[i - 1][1][0] + dp[i - 1][1][1];
			}
			else
			{
				dp[i][0][1] += dp[i - 1][1][1];
				dp[i][0][0] += dp[i - 1][1][0];
			}
		}

		// 桁通り -> 桁通り
		if (s[i] == '8')
		{
			dp[i][1][1] += dp[i - 1][1][0] + dp[i - 1][1][1];
		}
		else
		{
			dp[i][1][1] += dp[i - 1][1][1];
			dp[i][1][0] += dp[i - 1][1][0];
		}
	}
	cout << (dp[s.size() - 1][0][1] + dp[s.size() - 1][1][1]).val() << endl;

	return 0;
}