N=int(input())
X=input()
X=list(map(lambda x: int(x),X))
mod=998244353

dp0 = [[0]*11 for _ in range(N)]
dp1 = [[0]*11 for _ in range(N)]
dp2 = [[0]*11 for _ in range(N)]
dp3 = [[0]*11 for _ in range(N)]


for i in range(1,X[0]):
    dp1[0][i]=1
dp0[0][X[0]]=1

for i in range(1,N):
    for j in range(11):
        
        for k in range(10):
            if (-j * 2 + k) % 11 == 0 :
                dp3[i][(j * 10 + k) % 11]=(dp3[i][(j * 10 + k) % 11]+dp1[i - 1][j])%mod
            else :
                dp1[i][(j * 10 + k) % 11]= (dp1[i][(j * 10 + k) % 11]+dp1[i - 1][j])%mod
        
        for k in range(10):
            dp3[i][(j*10+k)%11]=(dp3[i][(j*10+k)%11]+dp3[i-1][j])%mod
        
        for k in range(X[i]):
            if (-j * 2 + k) % 11 == 0 :
                dp3[i][(j * 10 + k) % 11]=(dp3[i][(j * 10 + k) % 11]+dp0[i - 1][j])%mod
            else :
                dp1[i][(j * 10 + k) % 11]= (dp1[i][(j * 10 + k) % 11]+dp0[i - 1][j])%mod
        
        for k in range(X[i]):
            dp3[i][(j*10+k)%11]=(dp3[i][(j*10+k)%11]+dp2[i-1][j])%mod

        if (-j*2+X[i])%11==0:
            dp2[i][(j*10+X[i])%11]=(dp2[i][(j*10+X[i])%11]+dp0[i-1][j])%mod
        else:
            dp0[i][(j*10+X[i])%11]=(dp0[i][(j*10+X[i])%11]+dp0[i-1][j])%mod

        dp2[i][(j*10+X[i])%11]=(dp2[i][(j*10+X[i])%11]+dp2[i-1][j])%mod
    for k in range(1,10):
        dp1[i][k]=(dp1[i][k]+1)%mod


ans=(dp0[N-1][0]+dp1[N-1][0])%mod
print(ans)