from heapq import heappop, heappush

n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mod = 998244353

fact = [1] * (n + 1)
for i in range(2, n + 1):
    fact[i] = fact[i - 1] * i % mod

H = []
for i in range(n):
    heappush(H, (A[i], 0))
    heappush(H, (B[i], 1))
C = [n, n]
for i in range(n):
    _, j = heappop(H)
    C[j] -= 1
ans = fact[C[0]] * fact[C[1]] % mod
print(ans)