#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using Matrix = vector<vector<ll>>;
const int inf = 1000000000;
const ll INF = 1000000000000000000;
const ll mod = 998244353;
const ull mod_hash = (1UL << 61) - 1;
const vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};

int main(){
  int N;cin>>N;
  vector<ll> A(N);
  for (int i = 0; i < N; i++) cin>>A[i];
  sort(A.begin(), A.end());
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    ans *= 10;
    ans += A[i];
    ans %= mod;
  }
  cout << ans << endl;
  return 0;
}