#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)
#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;
// 任意型のベクターをランレングス圧縮して (値, 出現回数) のペア一覧を返す
template<typename T>
vector<pair<T,int>> runLengthEncode(const vector<T>& arr) {
    vector<pair<T,int>> result;
    if (arr.empty()) return result;

    T prev = arr[0];
    int count = 1;
    for (size_t i = 1; i < arr.size(); ++i) {
        if (arr[i] == prev) {
            ++count;
        } else {
            result.emplace_back(prev, count);
            prev = arr[i];
            count = 1;
        }
    }
    // 最後のランを追加
    result.emplace_back(prev, count);
    return result;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n;cin>>n;
  vl C(n);
  rep(i,0,n)cin>>C[i];
 if(n%2==0){
    sort(all(C));
    auto rle=runLengthEncode(C);
    vl stc;
    for(auto&[a,b]:rle){
        if(b%2==1){
            stc.push_back(a);
        }
    }
    ll ans=infl;
    ll len=stc.size();
    rep(i,0,1<<len){
        vl A,B;
        rep(j,0,len){
            if(i&(1<<j)){
                A.push_back(stc[j]);
            }else{
                B.push_back(stc[j]);
            }
        }
        if(A.size()!=B.size())continue;
        do{
            do{
                ll a=0,b=0;
                rep(ii,0,len/2){
                    a*=10;
                    b*=10;
                    a+=A[ii];
                    b+=B[ii];
                }
                ans=min(ans,abs(a-b));
            }while(next_permutation(all(B)));
        }while(next_permutation(all(A)));
    }
    cout<<ans<<el;
 }else{
    sort(all(C));
    vl A(C.begin(),C.begin()+n/2+1),B(C.rbegin(),C.rbegin()+n/2);
    mint stc1=0,stc2=0;
    for(ll i:A){
        stc1*=10;
        stc1+=i;
    }
    for(ll i:B){
        stc2*=10;
        stc2+=i;
    }
    mint ans=stc1-stc2;
    cout<<ans.val()<<el;
 }
}