#include #ifdef LOCAL #include "./debug.cpp" #else #define debug(...) #define print_line #endif using namespace std; using ll = long long; #include /** * @brief Modint */ template struct modint { long long value; modint(long long x = 0) { if (x >= 0) { value = x % MOD; } else { value = MOD - (-x) % MOD; } } modint operator-() const { return modint(-value); } modint operator+() const { return modint(*this); } modint &operator+=(const modint &other) { value += other.value; if (value >= MOD) { value -= MOD; } return *this; } modint &operator-=(const modint &other) { value += MOD - other.value; if (value >= MOD) { value -= MOD; } return *this; } modint &operator*=(const modint other) { value = value * other.value % MOD; return *this; } modint &operator/=(modint other) { (*this) *= other.inv(); return *this; } modint operator+(const modint &other) const { return modint(*this) += other; } modint operator-(const modint &other) const { return modint(*this) -= other; } modint operator*(const modint &other) const { return modint(*this) *= other; } modint operator/(const modint &other) const { return modint(*this) /= other; } modint pow(long long x) const { modint ret(1), mul(value); while (x > 0) { if (x % 2 == 1) { ret *= mul; } mul *= mul; x /= 2; } return ret; } modint inv() const { return pow(MOD - 2); } bool operator==(const modint &other) const { return value == other.value; } bool operator!=(const modint &other) const { return value != other.value; } friend std::ostream &operator<<(std::ostream &os, const modint &x) { return os << x.value; } friend std::istream &operator>>(std::istream &is, modint &x) { long long v; is >> v; x = modint(v); return is; } }; using mod998 = modint<998244353>; using mod107 = modint<1000000007>; using mint = mod998; int main() { int N; cin >> N; vector X(N), Y(N); for (int i = 0; i < N; i++) cin >> X[i]; for (int i = 0; i < N; i++) cin >> Y[i]; vector> P; for (int i = 0; i < N; i++) P.push_back(pair(X[i], 1)); for (int i = 0; i < N; i++) P.push_back(pair(Y[i], 2)); sort(P.begin(), P.end()); int x = 0; for (int i = 0; i < N; i++) { if (P[i].second == 1) x++; } int y = N - x; mint ans = 1; for (int i = 1; i <= x; i++) ans *= i; for (int i = 1; i <= y; i++) ans *= i; cout << ans << endl; }