import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import Counter
from itertools import permutations

def toint(aa):
    x = 0
    for a in aa: x = (x*10+a)%md
    return x

n = II()
cc = LI()
if n & 1:
    cc.sort()
    print((toint(cc[:n//2+1])-toint(cc[n//2+1:][::-1]))%md)
else:
    cnt = Counter(cc)
    aa = []
    for a, c in cnt.items():
        if c & 1: aa.append(a)
    m = len(aa)
    if m == 0:
        print(0)
        exit()
    aa.sort()
    ans = inf
    for p in permutations(aa):
        x=toint(p[:m//2])
        y=toint(p[m//2:])
    # for i in range(m-1):
    #     x = aa[i+1]
    #     y = aa[i]
    #     l, r = 0, m-1
    #     while 1:
    #         while l == i or l == i+1: l += 1
    #         while r == i or r == i+1: r -= 1
    #         if l >= r: break
    #         x = x*10+aa[l]
    #         y = y*10+aa[r]
    #         l+=1
    #         r-=1
        ans = min(ans, abs(x-y))
    print(ans)