#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 998244353
using ll = long long int;

int factorial (int x) {
  int ret = 1;
  while (x > 1) {
    ret = ((ll)ret * (ll)x) % MOD;
    x--;
  }
  return ret;
}

int main() {
  int N;
  cin >> N;
  vector<int> X(N), Y(N);
  rep(i, N) cin >> X[i];
  rep(i, N) cin >> Y[i];
  sort(X.begin(), X.end());
  sort(Y.rbegin(), Y.rend());
  int mid = 0;
  int xn, yn;
  if (X[0] > Y[0] && X[N-1] < Y[N-1]) {
    xn = N; yn = N;
  } else {
    rep(i, N)
      if (X[i] >= Y[i]) {
	mid = i;
	break;
      }
    xn = mid; yn = N - mid;
  }
  
  int ans = ((ll)factorial(xn) * (ll)factorial(yn)) % MOD;
  cout << ans << endl;
  return 0;
}