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
    A = []
    for j in range(1,9+1):
        D[j] = D[j]%2
        if D[j]==1:
            A.append(j)
    n = len(A)
    if n==0:
        ans = 0
    else:
        from itertools import permutations
        ans = MOD
        for p in permutations(A):
            b1 = 0
            b2 = 0
            for i in range(n//2):
                b1 = b1*10+p[i]
                b2 = b2*10+p[n-1-i]
            ans = min(ans,abs(b1-b2))
print(ans)