#include <bits/stdc++.h>
using namespace std;
constexpr unsigned long long mod = 998244353;
unsigned long long powm(unsigned long long a, int p) {
  if (p == 0) {
    return 1;
  } else if (p % 2 == 0) {
    unsigned long long c = powm(a, p / 2);
    return c * c % mod;
  } else {
    unsigned long long c = powm(a, p / 2);
    return (a * c % mod) * c % mod;
  }
}
unsigned long long inv(unsigned long long a) { return powm(a, mod - 2); }
array<unsigned long long, 300001> factorial;
unsigned long long choose(int a, int b) {
  return (factorial[a] * inv(factorial[b]) % mod) * inv(factorial[a - b]) % mod;
}
int main() {
  {
    factorial[0] = 1;
    unsigned long long f = 1;
    for (unsigned long long i = 1; i < 300001; ++i) {
      f = f * i % mod;
      factorial[i] = f;
    }
  }
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<unsigned long long> a(2 * n);
  for (unsigned long long &i : a) {
    cin >> i;
  }
  sort(a.begin(), a.end());
  unsigned long long sum = 0;
  for (int i = 0; i < n; ++i) {
    unsigned long long c = 0;
    c = choose(2 * n - 1, n - 1) * 2;
    sum = (sum + mod - c * a[i] % mod) % mod;
  }
  for (int i = n; i < 2 * n; ++i) {
    unsigned long long c = 0;
    c = choose(2 * n - 1, n - 1) * 2;
    sum = (sum + c * a[i] % mod) % mod;
  }
  cout << sum << '\n';
}
