#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000 + 5;
const int N = 4e5 + 5;
const int M = 131072;
const long long oo = LLONG_MAX;
const int mod = 998244353;
void add_self(long long& a, long long b) {
  a += b;
  a %= mod;
}
long long mul(long long a, long long b) { return 1ll * a * b % mod; }
long long poww(long long a, long long b) {
  long long r = 1;
  while (b) {
    if (b & 1) r = mul(r, a);
    a = mul(a, a);
    b >>= 1;
  }
  return r;
}
long long inv(long long x) { return poww(x, mod - 2); }
long long fac[N];
int bino(long long n, long long k) {
  return mul(fac[n], mul(inv(fac[k]), inv(fac[n - k])));
}
long long add(long long a, long long b) { return ((a + b) % mod + mod) % mod; }
void init() {
  fac[0] = fac[1] = 1;
  for (int i = 2; i < N; ++i) fac[i] = mul(fac[i - 1], i);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  init();
  int n;
  cin >> n;
  vector<long long> a(n * 2);
  for (int i = 0; i < n * 2; ++i) cin >> a[i];
  sort((a).begin(), (a).end());
  long long sum1 = 0, sum2 = 0;
  for (int i = 0; i < n; ++i) add_self(sum1, a[i]);
  for (int i = n; i < n * 2; ++i) add_self(sum2, a[i]);
  long long diff = 0;
  add_self(diff, add(sum2, -sum1));
  cout << mul(diff, bino(mul(n, 2), n));
  return 0;
}
