#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using P = pair<int, int>;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

ll f[100005];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());

    vector<int> b(n);
    for (int i = 0; i < n; i++) {
        cin >> b[i];
    }
    sort(b.begin(), b.end());

    f[0] = 1;
    for (int i = 1; i <= n; i++) {
        f[i] = f[i-1]*i%MOD;
    }

    ll ans = 1;
    for (int i = 0, j = 1; i < n; i++) {
        int L1 = min(a[i], b[i]);
        int R1 = max(a[i], b[i]);
        while (j < n) {
            int L2 = min(a[j], b[j]);
            int R2 = max(a[j], b[j]);
            if (R1 < L2) break;
            j++;
        }

        int num = max(j - i, 0);
        (ans *= num) %= MOD;
    }
    cout << ans << endl;
    return 0;
}