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

int main() {
  int N;
  cin >> N;
  vector<int> A(N), B(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  for (int i = 0; i < N; i++) {
    cin >> B[i];
  }
  
  sort(A.begin(), A.end());
  sort(B.begin(), B.end());
  
  int count = 0;
  
  do {
    do {
      int A_count = 0;
      for (int i = 0; i < N; i++) {
        if (A[i] > B[i]) {
          A_count++;
        }
      }
      if (A_count > N / 2) {
        count++;
      }
    } while (next_permutation(A.begin(), A.end()));
  } while (next_permutation(B.begin(), B.end()));
  
  int fact = 1;
  for (int i = 1; i <= N; i++) {
    fact *= i;
  }
  
  cout << count / pow(fact, 2) << endl;
}