#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int freq[10]{};
  rep(_, n) {
    int c;
    cin >> c;
    freq[c]++;
  }
  if (n % 2) {
    mint x, y;
    int ptr = 0;
    rep(_, (n + 1) / 2) {
      while (!freq[ptr]) ptr++;
      freq[ptr]--;
      x = 10 * x + ptr;
    }
    ptr = 9;
    rep(_, n / 2) {
      while (!freq[ptr]) ptr--;
      freq[ptr]--;
      y = 10 * y + ptr;
    }
    mint ans = x - y;
    cout << ans.val() << '\n';
  } else {
    VI d;
    rep(i, 10) if (freq[i] % 2) d.emplace_back(i);
    int sz = d.size();
    int ans = 999999999;
    do {
      int x = 0, y = 0;
      rep(i, sz) {
        if (i < sz / 2) x = 10 * x + d[i];
        else y = 10 * y + d[i];
      }
      chmin(ans, abs(x - y));
    } while (next_permutation(all(d)));
    d.clear();
    rep(i, 9) if (freq[i] && freq[i+1]) {
      freq[i]--, freq[i+1]--;
      int x = i+1, y = i;
      int cnt = 0;
      rep(i, 10) cnt += freq[i] % 2;
      int ptr = 0;
      rep(_, cnt / 2) {
        while (freq[ptr] % 2 == 0) ptr++;
        x = 10 * x + ptr++;
      }
      ptr = 9;
      rep(_, cnt / 2) {
        while (freq[ptr] % 2 == 0) ptr--;
        y = 10 * y + ptr--;
      }
      chmin(ans, x - y);
      freq[i]++, freq[i+1]++;
    }
    cout << ans << '\n';
  }
}