#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    string N;
    cin >> N;
    ll len = N.size();
    vector<vector<ll>> kdp1(len, vector<ll>(4));
    vector<vector<ll>> kdp2(len, vector<ll>(4));

    ll fst = (ll)(N[0] - '0');
    if (fst == 4) {
        kdp1[0][1] = 1;
    } else {
        kdp1[0][0] = 1;
    }
    for (ll i = 0; i < fst; i++) {
        if (i == 4) {
            kdp2[0][1] += 1;
        } else {
            kdp2[0][0] += 1;
        }
    }
    for (ll i = 1; i < len; i++) {
        for (ll k = 0; k <= 9; k++) {
            if (k == 4) {
                kdp2[i][1] += kdp2[i - 1][0];
                kdp2[i][1] += kdp2[i - 1][1];
                kdp2[i][1] %= mod2;
            } else if (k == 0) {
                kdp2[i][0] += kdp2[i - 1][0];
                kdp2[i][2] += kdp2[i - 1][1];
                kdp2[i][0] += kdp2[i - 1][2];
                kdp2[i][0] %= mod2;
                kdp2[i][2] %= mod2;
            } else {
                for (ll j = 0; j < 3; j++) {
                    kdp2[i][0] += kdp2[i - 1][j];
                    kdp2[i][0] %= mod2;
                }
            }
        }
        ll now = (ll)(N[i] - '0');
        // debug(now);
        for (ll k = 0; k < now; k++) {
            if (k == 4) {
                kdp2[i][1] += kdp1[i - 1][0];
                kdp2[i][1] += kdp1[i - 1][1];
                kdp2[i][1] %= mod2;
            } else if (k == 0) {
                kdp2[i][0] += kdp1[i - 1][0];
                kdp2[i][2] += kdp1[i - 1][1];
                kdp2[i][0] += kdp1[i - 1][2];
                kdp2[i][0] %= mod2;
                kdp2[i][2] %= mod2;
            } else {
                for (ll j = 0; j < 3; j++) {
                    kdp2[i][0] += kdp1[i - 1][j];
                    kdp2[i][0] %= mod2;
                }
            }
        }
        if (now == 0) {
            kdp1[i][0] += kdp1[i - 1][0];
            kdp1[i][2] += kdp1[i - 1][1];
            kdp1[i][0] += kdp1[i - 1][2];
            kdp1[i][0] %= mod2;
            kdp1[i][2] %= mod2;
        } else if (now == 4) {
            kdp1[i][1] += kdp1[i - 1][0];
            kdp1[i][1] += kdp1[i - 1][1];
            kdp1[i][1] %= mod2;
        } else {
            for (ll j = 0; j < 3; j++) {
                kdp1[i][0] += kdp1[i - 1][j];
                kdp1[i][0] %= mod2;
            }
        }
    }
    // debug(kdp1);
    // debug(kdp2);
    ll ans = 0;
    for (ll j = 0; j <= 2; j++) {
        ans += kdp1[len - 1][j];
        ans += kdp2[len - 1][j];
    }
    cout << (ans + mod2 - 1) % mod2 << endl;
}