using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = ReadLine();
        if (n.Length < 3)
        {
            WriteLine(int.Parse(n));
            return;
        }
        var mod = 998_244_353;
        var dp = new long[100];
        var dp1 = 1;
        var top = int.Parse(n[0..2]);
        for (var i = 0; i < top; ++i) ++dp[i];
        for (var i = 2; i < n.Length; ++i)
        {
            var ndp = new long[100];
            for (var k = 0; k < 10; ++k)
            {
                var sum = 0L;
                for (var j = 0; j < 10; ++j) sum = (sum + dp[j * 10 + k]) % mod;
                for (var j = 0; j < 10; ++j)
                {
                    if (k == 0 && j == 4) ndp[k * 10 + j] = (sum - dp[40] + mod) % mod;
                    else ndp[k * 10 + j] = sum;
                }
            }
            {
                var k = n[i - 1] - '0';
                for (var j = 0; j < n[i] - '0'; ++j)
                {
                    if (k == 0 && j == 4 && n[i - 2] == '4') continue;
                    ndp[k * 10 + j] = (ndp[k * 10 + j] + dp1) % mod;
                }
            }
            if (n[i - 2] == '4' && n[i - 1] == '0' && n[i] == '4') dp1 = 0;
            dp = ndp;
        }
        WriteLine((dp.Sum() % mod + dp1 - 1 + mod) % mod);
    }
}