#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}
int ch(vi &a){
    int b = 1;
    int ans = 0;
    drep(i, a.size()){
        ans += a[i]*b;
        b*=10;
    }return ans;
}

int main(){
    int n; cin >> n;
    vll cnt(10, 0);
    rep(i, n){
        int c; cin >> c;
        cnt[c]++;
    }
    if(n%2 != 0){
        deque<int> dq;
        rep(i, 10){
            rep(j, cnt[i])dq.push_back(i);
        }
        vi a(n/2+1, 0), b(n/2);
        rep(i, n/2){
            a[i] = dq.front();
            dq.pop_front();
            b[i] = dq.back();
            dq.pop_back();
        }a[n/2] = dq.front();
        
        mint ans = 0;
        mint ba = 1;
        drep(i, n/2+1){
            ans += ba*mint(a[i]);
            ba *= mint(10);
        }
        ba = 1;
        drep(i, n/2){
            ans -= ba*mint(b[i]);
            ba *= mint(10);
        }
        cout << ans.val() << endl;
    }else{
        vi v;
        rep(i, 10){
            if(cnt[i]%2 != 0)v.push_back(i);
        }
        int len = v.size();
        if(len == 0){
            cout << 0 << endl;
            return 0;
        }
        vi b(len, 0);
        rep(i, len/2)b[len-1-i] = 1;
        int ans = 100000;
        do{
            vvi d(2);
            rep(i, len){
                d[b[i]].push_back(v[i]);
            }
            do{
                do{
                    ans = min(ans, abs(ch(d[0]) - ch(d[1])));
                }while(next_permutation(all(d[1])));
            }while(next_permutation(all(d[0])));
        }while(next_permutation(all(b)));
        cout << ans << endl;
    }

    return 0;
}