#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

char s[N];
ll f[N], g[N];

int main() {
    g[0] = f[0] = 1;
    for (int i = 1; i < N; i++) f[i] = f[i - 1] * 9 % MOD, g[i] = g[i - 1] * 10 % MOD;
    scanf("%s", s + 1);
    n = strlen(s + 1);
    bool flag = 0;
    for (int i = 1; i < n + 1; i++) {
        for (int j = 0; j < s[i] - '0'; j++) {
            if (flag || j == 8) res = (res + g[n - i]) % MOD;
            else res = (res + g[n - i] - f[n - i] + MOD) % MOD;
        }
        flag |= s[i] == '8';
    }
    for (int i = 1; i < n + 1; i++)
        if (s[i] == '8') {
            res = (res + 1) % MOD;
            break;
        }
    printf("%lld\n", res);
    return 0;
}