#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)


int main(){

    string s; cin >> s;
    if(s.length() == 1){
        int i = stoi(s);
        cout << (i >= 8 ? 1 : 0) << endl;
        return 0;
    }
    int n = s.length();
    vvmi dp(n, vmi(2, mint(0)));
    int a = s[0] - '0';
    dp[0][0] = a == 8 ? mint(8): (a == 1 ? mint(1) :mint(a-1));
    dp[0][1] = s[0]  == '8' ? mint(0):mint(1);
    rep2(i, 1, n){
        int b = s[i] - '0';
        dp[i][0] = mint(9)*dp[i-1][0];
        if(b == 8 || b == 1 || b == 0){
            dp[i][0] += mint(b)*dp[i-1][1];
        }else{
            dp[i][0] += mint(b-1)*dp[i-1][1];
        }

        if(dp[i-1][1] == mint(1) && b != 8){
            dp[i][1] = mint(1);
        }
    }
    mint ans = mint(0);
    mint base = mint(1);
    drep(i, n){
        ans += mint(s[i]-'0')*base;
        base *= mint(10);
    }
    cout << (ans - dp[n-1][0] - dp[n-1][1] + 1).val() << endl;
    return 0;
}