def Z_algorithm(lst):
    le=len(lst)
    LCP=[None]*le
    LCP[0]=le
    L,R=0,0
    for i in range(1,le):
        if i<R:
            x=LCP[i-L]
            if x<R-i:
                LCP[i]=x
            elif R-i<x:
                LCP[i]=R-i
            else:
                while R<le and lst[R-i]==lst[R]:
                    R+=1
                LCP[i]=R-i
                L=i
        else:
            R=max(R,i)
            while R<le and lst[R-i]==lst[R]:
                R+=1
            LCP[i]=R-i
            L=i
    return LCP

S=input()
lcp=Z_algorithm(S)
lcp[0]=0
mod=998244353
N=len(S)
A=[None]*(N+1)
B=[None]*(N+1)
A[0]=1
B[0]=0
inve10=pow(10,mod-2,mod)
for i in range(N):
    if S[i]==S[0]:
        A[i+1]=(10*A[i]-9*A[lcp[i]])%mod
        B[i+1]=(10*B[i]-9*B[lcp[i]]-10)%mod
    else:
        A[i+1]=(10*A[i]-8*A[lcp[i]]-A[1])%mod
        B[i+1]=(10*B[i]-8*B[lcp[i]]-B[1]-10)%mod
ans=(-B[N])*pow(A[N],mod-2,mod)%mod
ans-=(N-1)
ans%=mod
print(ans)