#include <bits/stdc++.h>
using namespace std;
const int maxn = 150010;
const double Pi = acos(-1.0);
const double eps = 1e-7;
template <class T>
void read(T &x) {
  x = 0;
  int f = 0;
  char ch = getchar();
  while (!isdigit(ch)) {
    f |= (ch == '-');
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  x = f ? -x : x;
  return;
}
int n;
long long a[maxn << 1], ans, num, p;
long long mod = 998244353;
inline long long power(long long a, long long b, long long p) {
  long long ans = 1;
  for (; b; b >>= 1) {
    if (b & 1) ans = ans * a % p;
    a = a * a % p;
  }
  return ans % p;
}
inline long long inv(long long x) { return power(x, mod - 2, mod); }
int main() {
  scanf("%d", &n);
  num = 1;
  p = 1;
  for (int i = 1; i <= (n << 1); i++) scanf("%lld", &a[i]);
  for (int i = n + 1; i <= (n << 1); i++) {
    num = num * i % mod;
    p = p * (i - n) % mod;
  }
  num = num * inv(p) % mod;
  sort(a + 1, a + 2 * n + 1);
  ans = 0;
  for (int i = 1; i <= n; i++) ans = (ans - num * a[i] % mod + mod) % mod;
  for (int i = n + 1; i <= 2 * n; i++) ans = (ans + num * a[i] % mod) % mod;
  printf("%lld", ans);
  return 0;
}
