#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void __print(int x) { cout << x; }
void __print(long x) { cout << x; }
void __print(long long x) { cout << x; }
void __print(unsigned x) { cout << x; }
void __print(unsigned long x) { cout << x; }
void __print(unsigned long long x) { cout << x; }
void __print(float x) { cout << x; }
void __print(double x) { cout << x; }
void __print(long double x) { cout << x; }
void __print(char x) { cout << '\'' << x << '\''; }
void __print(const char *x) { cout << '\"' << x << '\"'; }
void __print(const string &x) { cout << '\"' << x << '\"'; }
void __print(bool x) { cout << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cout << '{';
  __print(x.first);
  cout << ',';
  __print(x.second);
  cout << '}';
}
template <typename T>
void __print(const T &x) {
  int first = 0;
  cout << '{';
  for (auto &i : x) cout << (first++ ? "," : ""), __print(i);
  cout << "}";
}
void _print() { cout << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cout << ", ";
  _print(v...);
}
template <class T>
void remdup(vector<T> &v) {
  sort((v).begin(), (v).end());
  v.erase(unique((v).begin(), (v).end()), end(v));
}
template <typename T>
struct cmp {
  bool operator()(const T &p1, const T &p2) {}
};
const long long N = 3e5 + 100;
const long long mod = 998244353;
const long long X = 1e5 + 100;
const long long Y = 1e9 + 100;
long long power(long long x, long long n) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return result;
}
long long pinverse(long long A, long long M) { return power(A, M - 2); }
long long fact[N], invfact[N];
void precompute() {
  fact[0] = fact[1] = 1;
  for (long long i = (2); i < (N); ++i) fact[i] = (fact[i - 1] * i) % mod;
  invfact[N - 1] = pinverse(fact[N - 1], mod);
  for (long long i = (N - 2); i >= (0); --i)
    invfact[i] = (invfact[i + 1] * (i + 1)) % mod;
}
long long nCr(long long x, long long y) {
  if (y > x) return 0;
  long long num = fact[x];
  num = (num * invfact[y]) % mod;
  num = (num * invfact[x - y]) % mod;
  return num;
}
int main() {
  long long t = 1;
  precompute();
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> a(2 * n);
    for (long long i = (0); i < (2 * n); ++i) cin >> a[i];
    sort((a).begin(), (a).end());
    long long sum = 0;
    for (long long i = (0); i < (2 * n); ++i) sum += ((i < n) ? -a[i] : a[i]);
    sum %= mod;
    sum *= nCr(2 * n, n);
    sum %= mod;
    cout << sum << "\n";
  }
  return 0;
}
