#include <bits/stdc++.h>
using namespace std;
long long int mod = 998244353;
long long int arr[400050];
long long int power(long long int a, long long int b) {
  if (b == 0) return 1ll;
  long long int ans = power(a, b / 2);
  ans = (ans * ans) % mod;
  if (b & 1) ans = (ans * a) % mod;
  return ans;
}
long long int fact(long long int n) {
  long long int ans = 1;
  for (int i = 1; i <= n; i++) ans = (ans * i) % mod;
  return ans;
}
long long int solve(long long int n, long long int r) {
  long long int a = fact(n), b = fact(r), c = fact(n - r);
  return (a * (power(b, mod - 2) * power(c, mod - 2) % mod)) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> arr[i];
  sort(arr + 1, arr + 1 + 2 * n);
  long long int sum = 0;
  for (int i = 1; i <= n; i++) sum = (sum - arr[i]) % mod;
  for (int i = n + 1; i <= 2 * n; i++) sum = (sum + arr[i]) % mod;
  long long int ans = solve(2 * n, n);
  ans = (ans * sum) % mod;
  cout << ans;
  return 0;
}
