#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;

using mint = atcoder::modint998244353;
int main(){
    string n;
    cin >> n;
    int ns = n.size();
    vector<int> digits(ns);
    vector<vector<vector<mint>>> dp(ns + 1,vector<vector<mint>> (2,vector<mint>(4,0)));
    for(int i = 0;i < ns;i++){
        digits[i] = stoi(n.substr(i,1));
    }
    dp[0][0][0] = 1;
    for(int i = 0;i < ns;i++){
        for(int d = 0;d < 10;d++){
            if(d == 4){
                if(d < digits[i]){
                    dp[i+1][1][1] += dp[i][0][0] + dp[i][0][1];
                    dp[i+1][1][3] += dp[i][0][2];
                }
                if(d == digits[i]){
                    dp[i+1][0][1] += dp[i][0][0] + dp[i][0][1];
                    dp[i+1][0][3] += dp[i][0][2];
                }
                dp[i+1][1][1] += dp[i][1][0] + dp[i][1][1];
                dp[i+1][1][3] += dp[i][1][2];
            }
            else if(d == 0){
                if(d < digits[i]){
                    dp[i+1][1][2] += dp[i][0][1];
                    dp[i+1][1][0] += dp[i][0][0] + dp[i][0][2];
                }
                if(d == digits[i]){
                    dp[i+1][0][2] += dp[i][0][1];
                    dp[i+1][0][0] += dp[i][0][0] + dp[i][0][2];
                }
                dp[i+1][1][2] += dp[i][1][1];
                dp[i+1][1][0] += dp[i][1][0] + dp[i][1][2];
            }
            else{
                if(d < digits[i]){
                    dp[i+1][1][0] += dp[i][0][0] + dp[i][0][1] + dp[i][0][2];
                }
                if(d == digits[i]){
                    dp[i+1][0][0] += dp[i][0][0] + dp[i][0][1] + dp[i][0][2];
                }
                dp[i+1][1][0] += dp[i][1][0] + dp[i][1][1] + dp[i][1][2];
            }
        }
    }

    mint ans = 0;

    for(int j = 0;j < 2;j++){
        for(int d = 0;d < 3;d++){
            ans += dp[ns][j][d];
        }
    }
    cout << ans.val() - 1 << endl;
    return 0;
}