import typing
import sys
from collections import defaultdict, deque
import heapq
from functools import cmp_to_key
input = lambda: sys.stdin.readline().strip()
inf = 10**18
mod = 998244353
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# sys.setrecursionlimit(10**6)


def solve():
  def cmp(x, y):
    a = pow(10, len(y))*int(x) + int(y)
    b = pow(10, len(x))*int(y) + int(x)
    if a > b:
      return 1
    if a < b:
      return -1
    return 0

  N = int(input())
  l = input().split()
  l.sort(key=cmp_to_key(cmp))
  ans = 0
  for x in l:
    ans = pow(10, len(x))*ans + int(x)
    ans %= mod
  print(ans)
def main():
  t = 1
  for _ in range(t):
    solve()
main()