#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=998244353;
const int N=150000+100;
int a[2*N];
ll sum[2];
int fac[2*N];
int infac[2*N];
ll qp(int a,int b){
ll ans=1;
while(b){
if(b&1){
ans=ans*a%mod;
}
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
void init(){
fac[0]=1;
infac[0]=1;
for(int i=1;i<2*N;i++){
fac[i]=1ll*fac[i-1]*i%mod;
infac[i]=1ll*infac[i-1]*qp(i,mod-2)%mod;
}
}
int main(){
init();
int n;scanf("%d",&n);
n*=2;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+1+n);
for(int i=1;i<=n/2;i++) sum[0]=sum[0]+a[i];
for(int i=n/2+1;i<=n;i++) sum[1]=sum[1]+a[i];
//cout<<infac[n/2]<<endl;
ll ans=1ll*(sum[1]-sum[0]+mod)%mod*fac[n]%mod*infac[n/2]%mod*infac[n/2]%mod;
printf("%lld\n",ans);
return 0;
}