#include<bits/stdc++.h>
#include <atcoder/all>
using namespace std;using namespace atcoder;using vst = vector<string>;using ll = long long;
using ld = long double;using pll = pair<ll,ll>;using vll = vector<ll>;using vvll = vector<vll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repp(i,k,n) for (ll i = k; i < n; i++)
#define per(i,s,e) for(ll i = s; i >= e; i--)
#define all(v) v.begin(),v.end()
#define no() {cout << "No" << endl; return 0;}
#define yes(){cout << "Yes" << endl;return 0;}
#define CHECK(a) a ? cout << "Yes" << endl : cout << "No" << endl
#define MODD 998244353LL
#define MOD 1000000007LL
#define UNOmap unordered_map
#define UNOset unordered_set
#define ASC(T) T,vector<T>,greater<T>
#define join(G,a,b) G[a].push_back(b);G[b].push_back(a);
template<class... T>void in(T&... a){(cin >> ... >> a);}
template<class T, class... Ts>void out(const T& a, const Ts&... b){cout << a;((cout << ' ' <<  b), ...);cout << '\n';}
void vin(vll &v){for(ll i = 0; i < (ll)v.size(); i++)in(v[i]);}
void vout(vll &v){for(ll i = 0; i < (ll)v.size(); i++) cout << v[i] << ' ';}
ll INF = 1LL << 62;

// #include<boost/multiprecision/cpp_int.hpp>
// using namespace boost::multiprecision;

 using mint = modint998244353;
// using mint = modint1000000007;
//using mint = modint;


// cout << fixed << setprecision(15);
//----------------------------------------------


int main(){
  ll N;
  in(N);
  vll X(N),Y(N);
  map<ll,ll> be;
  rep(i,N){
    in(X[i]);
    be[X[i]] = 1;
  }
  rep(i,N){
    in(Y[i]);
    be[Y[i]] = -1;
  }
  vll Z(2*N);
  rep(i,N){
    Z[i] = X[i];
  }
  rep(i,N){
    Z[i+N] = Y[i];
  }
  
  sort(all(Z));
  ll num = 0;
  rep(i,N){
    if(be[Z[i]] == 1) num++;
  }
  
  
  mint ans =1;
  repp(i,2,num+1) ans*=i;
  repp(i,2,N-num+1) ans *=i;
  out(ans.val());
  
}