#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

int main() {
    int N;
    cin >> N;
    vector<ll> A, B;
    vector<int> C;
    int x, y;
    for (int i = 0; i < N; i++) {
        cin >> x;
        A.push_back(x);
        C.push_back(x);
    }
    for(int i=0; i<N; i++) {
        cin >> y;
        B.push_back(y);
        C.push_back(y);
    }

    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    sort(C.begin(), C.end());

    ll ans = C[N-1];
    ll a;
    ll b;
    if(find(A.begin(), A.end(), ans) != A.end()) {
        a = lower_bound(A.begin(), A.end(), ans) - A.begin() + 1;
        b = N - a;
    }else{
        a = lower_bound(B.begin(), B.end(), ans) - B.begin() + 1;
        b = N - a;
    }

    ll z = 1;
    for(ll i=1; i<=a; i++) {
        z = (z * i + 998244353ll) % 998244353ll;
    }
    for(ll i=1; i<=b; i++) {
        z = (z * i + 998244353ll) % 998244353ll;
    }
    cout << z << endl;
}