#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define rrep(i, a, n) for(int i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double

// using mint = modint1000000007;
using mint = modint998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1e18;

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

int main(){
    int n; cin >> n;
    vector<int> c(n);
    rep(i, 0, n){
        cin >> c[i];
    }
    if(n%2 == 1){
        sort(c.begin(), c.end());
        mint ans = mint(c[0])*mint(10).pow(n/2);
        mint ten = 1;
        rrep(i, n/2, 1){
            ans += ten*c[i];
            ten *= 10;
        }
        ten /= 10;
        rep(i, n/2+1, n){
            ans -= ten*c[i];
            ten /= 10;
        }
        cout << ans.val() << endl;
    }else{
        vector<int> cnt(10);
        rep(i, 0, n) cnt[c[i]]++;
        vector<int> p;
        rep(i, 1, 10){
            if(cnt[i]%2 == 1) p.emplace_back(i);
        }

        int m = p.size();
        int ans = IINF;
        do{
            mint x = 0, y = 0;
            rep(i, 0, m/2){
                x += mint(10).pow(i)*p[i];
            }
            rep(i, m/2, m){
                y += mint(10).pow(i-m/2)*p[i];
            }
            chmin(ans, abs((int)x.val()-(int)y.val()));
        }while(next_permutation(p.begin(), p.end()));
        cout << ans << endl;
    }
   
    
    return 0;
}