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

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


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

for i in range(N-1):
    for S in range(2**11):
        for k in range(11):
            n_bit=0
            for l in range(11):
                if S>>l&1:
                    n_bit|= 1<<(l*10)%11
            for l in range(10):
                nxt_bit=(n_bit|(1<<k))
                dp0[i+1][nxt_bit][(k*10+l)%11]=  (dp0[i+1][nxt_bit][(k*10+l)%11]+dp0[i][S][k])%mod
                if l<X[i+1]:
                    dp0[i+1][nxt_bit][(k*10+l)%11]=  (dp0[i+1][nxt_bit][(k*10+l)%11]+dp1[i][S][k])%mod
                elif l==X[i+1]:
                    dp1[i+1][nxt_bit][(k*10+l)%11]=  (dp1[i+1][nxt_bit][(k*10+l)%11]+dp1[i][S][k])%mod
                n_bit<<=1
                if ((n_bit>>11)&1):
                    n_bit^=((1<<11) | 1)
    for l in range(1,10):
        dp0[i+1][1][l]=(dp0[i+1][1][l]+1)%mod

ans=0
for S in range(2**11):
    if S&1:
        continue
    ans=(ans+dp0[N-1][S][0]+dp1[N-1][S][0])%mod
print(ans)