#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define ld long double
using namespace std;
using namespace atcoder;
using ll = long long;
const ll mod = 998244353;
using mint = modint998244353;
using Graph = vector<vector<pair<int,int>>>;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};

int main(){
  // input
  int N; cin >> N;
  vector<string> A(N);
  for(int i = 0; i < N; i++){
    cin >> A[i];
  }
  
  // prep
  vector<vector<int>> B(N,vector<int>(19,10));
  for(int i = 0; i < N; i++){
    for(int j = 0; j < A[i].size(); j++){
      int c = A[i][j] - '0';
      B[i][j] = c;
    }
  }
  sort(B.begin(),B.end());
  
  // solve
  mint ans = 0;
  for(int i = 0; i < N; i++){
    for(int j = 0; j < 19; j++){
      if(B[i][j] < 10){
        ans *= 10;
        ans += B[i][j];
      }
    }
  }
  
  // output
  cout << ans.val() << endl;
}