#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
using namespace std;
typedef pair<int, char> P;

const int mod = 998244353;
int n;
P pa[200000];
int fact[100001];

signed main() {
	int i;
	
	cin >> n;
	
	fact[0] = 1;
	for (i = 1; i <= n; i++) {
		fact[i] = fact[i - 1] * i % mod;
	}
	
	for (i = 0; i < n; i++) {
		int x;
		cin >> x;
		pa[i] = P(x, 'x');
	}
	
	for (i = 0; i < n; i++) {
		int y;
		cin >> y;
		pa[n + i] = P(y, 'y');
	}
	
	sort(pa, pa + 2 * n);
	
	int cntx = 0;
	int cnty = 0;
	for (i = 0; i < n; i++) {
		if (pa[i].second == 'x') {
			cntx++;
		}
		else {
			cnty++;
		}
	}
	
	cout << fact[cntx] * fact[cnty] % mod << endl;
	return 0;
}