import itertools

N = int(input())
C = list(map(int,input().split()))
mod = 998244353
ans = 0
if N % 2 == 1:
  C.sort()
  X = N // 2 + 1
  for i in range(X):
    ans += C[i]*pow(10,X-i-1,mod)
    ans %= mod
  for i in range(X,N):
    ans -= C[i]*pow(10,i-X,mod)
    ans %= mod
  print(ans)  
else:
  S = {}
  for i in range(N):
    if C[i] in S:
      S[C[i]] += 1
    else:
      S[C[i]] = 1
  L = []
  for i in S:
    if S[i] % 2 == 1:
      L.append(i)
  l = len(L)    
  R = list(itertools.permutations(L))
  r = len(R)
  ans = 10000000000
  for i in range(r):
    count = 0
    X = l // 2
    for j in range(X):
      count += R[i][j]*pow(10,X-j-1,mod)
      count %= mod
    for j in range(X,l):
      count -= R[i][j]*pow(10,j-X,mod)
      count %= mod
    ans = min(abs(count),ans)
  print(ans)