#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N;
    cin >> N;
    vector<ll> c(N);
    for (ll i = 0; i < N; i++){
        cin >> c[i];
    }
    vector<ll> kinds(10, 0);
    for (ll i = 0; i < N; i++){
        kinds[c[i]]++;
    }
    if (N % 2 == 1){
        sort(all(c));
        mint ans = mint(0);
        vector<ll> former(N / 2 + 1, 0);
        vector<ll> latter(N / 2 + 1, 0);
        for (ll i = 0; i < N; i++){
            if (i < N / 2 + 1){
                former[i] = c[i];
            }
            else{
                latter[N - i] = c[i];
            }
        }
        mint now = mint(1);
        for (ll i = N / 2; i >= 0; i--){
            ans += now * mint(former[i]);
            ans -= now * mint(latter[i]);
            now *= mint(10);
        }
        cout << ans.val() << endl;
    }
    else{
        vector<ll> ones(0);
        for (ll i = 1; i <= 9; i++){
            if (kinds[i] % 2 == 1){
                ones.push_back(i);
            }
        }
        ll ans = 1000000;
        do{
            ll anssub = 0;
            ll now = 1;
            ll half = ones.size() / 2;
            for (ll i = half - 1; i >= 0; i--){
                anssub += ones[i] * now;
                anssub -= ones[i + half] * now;
                now *= 10;
            }
            if (anssub >= 0){
                ans = min(ans, anssub);
            }
        }while(next_permutation(all(ones)));
        for (ll i = 1; i <= 9; i++){
            if (kinds[i] < 2){
                continue;
            }
            vector<ll> new_ones(0);
            for (ll j = 0; j < ones.size(); j++){
                new_ones.push_back(ones[j]);
            }
            new_ones.push_back(i);
            new_ones.push_back(i);
            sort(all(new_ones));
            do{
                ll anssub = 0;
                ll now = 1;
                ll half = new_ones.size() / 2;
                for (ll k = half - 1; k >= 0; k--){
                    anssub += new_ones[k] * now;
                    anssub -= new_ones[k + half] * now;
                    now *= 10;
                }
                if (anssub >= 0){
                    ans = min(ans, anssub);
                }
            }while(next_permutation(all(new_ones)));
        }
        cout << ans << endl;
    }
}