from math import e
import sys, time, random
from collections import deque, Counter, defaultdict
def debug(*x):print('debug:',*x, file=sys.stderr)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353

N = input()
n = len(N)
dp = [[0] * 3 for _ in range(n + 1)]

dp[0][0] = 1

for i in range(n):
    dp[i + 1][0] += dp[i][0] * 9
    dp[i + 1][0] %= mod
    dp[i + 1][1] += dp[i][0]
    dp[i + 1][1] %= mod
    dp[i + 1][1] += dp[i][1]
    dp[i + 1][1] %= mod
    dp[i + 1][2] += dp[i][1]
    dp[i + 1][2] %= mod
    dp[i + 1][0] += dp[i][1] * 8
    dp[i + 1][0] %= mod
    dp[i + 1][0] += dp[i][2] * 9
    dp[i + 1][0] %= mod
    

A = [-1, -1]
ans = 0

for i in range(n):
    unbef = A[-2]
    bef = A[-1]
    for to in range(0, int(N[i])):
        if unbef == 4 and bef == 0 and to == 4:
            continue
        elif to == 4:
            ans += dp[n - i - 1][0] + dp[n - i - 1][1]
            ans %= mod
        elif bef == 4 and to == 0:
            ans += dp[n - i - 1][0] + dp[n - i - 1][2]
            ans %= mod
        else:
            ans += dp[n - i - 1][0] + dp[n - i - 1][1] + dp[n - i - 1][2]
            ans %= mod
    A.append(int(N[i]))
if '404' in N:
    ans -= 1
    ans %= mod
print(ans)