#include<bits/stdc++.h>
// #include<atcoder/all>
#include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}



int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n;
  cin >> n;
  vector<P> a(n);
  rep(i,n)cin >> a[i].first;
  auto keta = [](ll a){
    ll res = 0;
    while(a)res++,a /= 10;
    return res;
  };
  rep(i,n)a[i].second = keta(a[i].first);
  vector<__int128_t> ten(20,1);
  rep(i,20-1)ten[i+1] = ten[i]*10;
  sort(ALL(a),[&](P a,P b){
    __int128_t A = ten[b.second]*a.first + b.first;
    __int128_t B = ten[a.second]*b.first + a.first;
    return A < B;
  });
  __int128_t res = 0;
  rep(i,n){
    res = (res*ten[a[i].second]%MOD + a[i].first)%MOD;
  }
  cout << (ll)res << "\n";
  
  

  return 0;
}