from heapq import heappush, heappop, heapify
import sys
from collections import defaultdict, deque,Counter
from math import ceil, floor, sqrt, factorial,gcd
from itertools import permutations, combinations,product
from bisect import bisect_left, bisect_right
from copy import deepcopy
from functools import lru_cache #@lru_cache(maxsize=None)
from fractions import Fraction
sys.setrecursionlimit(10**6)
# input = sys.stdin.readline
vector1 = [[0, -1], [1, 0], [0, 1], [-1, 0]]
vector2 = [[0, 1], [1, 0], [-1, 0], [0, -1],
           [1,-1], [-1, 1], [1, 1], [-1, -1]]





def main():
    N = int(input())
    A = list(map(int,input().split()))
    A.sort()
    ans = 0
    mod = 998244353
    for i in range(N):
        ans = ans*10 + A[i]
        ans = ans%mod
    print(ans%mod)
    
    
    
    


if __name__ == '__main__':
    main()