#include <bits/stdc++.h>
using namespace std;
const long long maxe = 1e6 + 1;
typedef long long mang[maxe];
long long n, k, ans, m = 998244353;
mang a, inv;
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  cin >> n;
  k = 2 * n;
  ans = 0;
  for (long long i = 1; i <= k; i++) cin >> a[i];
  sort(a + 1, a + k + 1);
  inv[1] = 1;
  for (long long i = 2; i <= n; i++) inv[i] = ((m - m / i) * inv[m % i]) % m;
  for (long long i = 2; i <= n; i++) k = (k * (2 * n - i + 1)) % m * inv[i] % m;
  for (long long i = 1; i <= n; i++) ans = (ans + (2 * m - a[i]) * k) % m;
  for (long long i = n + 1; i <= 2 * n; i++) ans = (ans + a[i] * k % m) % m;
  cout << ans;
}
