#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

#include <atcoder/modint>

using ll = long long;

using namespace std;

using mint = atcoder::modint998244353;

const int error[3] = {4, 0, 4};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    string S;
    cin >> S;

    vector dp(2, vector<mint>(3, 0)), ndp(2, vector<mint>(3, 0));
    dp[1][0] = 1;
    for (char& c : S) {
        int e = c - '0';
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 3; j++) {
                mint& val = dp[i][j];
                if (val == 0) continue;
                for (int d = 0; d < 10; d++) {
                    if (i == 1 and d > e) continue;
                    int ni = i, nj = j;
                    if (i == 1 and d < e) ni = 0;
                    if (d == error[j]) {
                        nj++;
                    } else if (d == 4) {
                        nj = 1;
                    } else {
                        nj = 0;
                    }
                    if (nj >= 3) continue;
                    ndp[ni][nj] += val;
                }
                val = 0;
            }
        }
        swap(dp, ndp);
    }

    mint ans = 0;
    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < 3; j++) {
            ans += dp[i][j];
        }
    }
    ans--;  // 0

    cout << ans.val() << "\n";
    return 0;
}