MOD = 998244353
N = int(input())
C = list(map(int,input().split()))
if N%2==1:
    A = [0]*(N//2+1)
    B = [0]*(N//2)
    C = sorted(C)
    for i in range(N//2):
        B[N//2-1-i] = C.pop()
    for i in range(N//2+1):
        A[i] = C.pop()
    ans = A[-1]
    for i in range(N//2-1,-1,-1):
        ans = (ans*10+A[i]-B[i])%MOD
else:
    D = {i:0 for i in range(1,9+1)}
    for i in range(N):
        D[C[i]] += 1
    n = 0
    for i in range(1,9+1):
        n += D[i]%2
    if n==0:
        ans = 0
    else:
        ans = MOD
        for i in range(2,9+1):
            for j in range(1,i):
                if D[i]==0 or D[j]==0:continue
                E = {i:0 for i in range(1,9+1)}
                F = []
                for k in range(1,9+1):
                    if k==i or k==j:
                        E[k] = (D[k]-1)%2
                    else:
                        E[k] = D[k]%2
                    if E[k]==1:
                        F.append(k)
                n = len(F)
                A = [0]*(n//2+1)
                B = [0]*(n//2+1)
                A[0] = i
                B[0] = j
                F = sorted(F)
                for i1 in range(n//2):
                    B[i1+1] = F.pop()
                for i1 in range(n//2):
                    A[n//2-i1] = F.pop()
                tot = A[0]-B[0]
                for i1 in range(1,n//2+1):
                    tot = (tot*10+A[i1]-B[i1])%MOD
                ans = min(ans,tot)        
print(ans)