#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
constexpr long long int M = 998244353;
long long int f[400010];
long long int inv(long long int a, long long int b = M) {
  return 1 < a ? b - inv(b % a, a) * b / a : 1;
}
long long int a[400010];
long long int choose(long long int n, long long int k) {
  return f[n] * inv(f[n - k]) % M * inv(f[k]) % M;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  f[0] = 1;
  for (long long int i = 1; i < 400010; ++i) f[i] = f[i - 1] * i % M;
  long long int n;
  cin >> n;
  for (long long int i = 0; i < 2 * n; ++i) cin >> a[i];
  sort(a, a + 2 * n);
  long long int x = accumulate(a, a + n, 0ll) % M;
  long long int y = accumulate(a + n, a + 2 * n, 0ll) % M;
  long long int ans = (y - x + M) % M;
  ans = ans * choose(2 * (n - 1) + 1, (n - 1) + 1) % M;
  ans = ans * 2 % M;
  cout << ans << endl;
}
