#include <bits/stdc++.h>
using namespace std;
int n, a[150005 * 2];
long long sum;
long long ksm(long long x, long long y) {
  long long ans = 1;
  for (; y; y /= 2, x = x * x % 998244353)
    if (y & 1) ans = ans * x % 998244353;
  return ans;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 2 * n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 2 * n + 1);
  sum = 0;
  for (int i = 1; i <= n; i++) sum = (sum - a[i] + 998244353) % 998244353;
  for (int i = 1; i <= n; i++) sum = (sum + a[i + n] + 998244353) % 998244353;
  for (int i = 1; i <= n; i++)
    sum = sum * (n + i) % 998244353,
    sum = sum * ksm(i, 998244353 - 2) % 998244353;
  printf("%lld\n", sum);
  return 0;
}
