#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

inline mint fact(int x) { return x == 0 ? 1 : x * fact(x - 1); }

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  int acnt = 0, bcnt = 0;
  rep(i, n) {
    if (a[acnt] <= b[bcnt])
      ++acnt;
    else
      ++bcnt;
  }
  cout << (fact(acnt) * fact(bcnt)).val() << '\n';
  return 0;
}