#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n; cin >> n;
    vector<int> vec0, vec1, vec2;
    for (int i = 1; i <= n; i++) vec0.push_back(i);
    for (int i = 1, x; i <= n; i++) cin >> x, vec1.push_back(x);
    for (int i = 1, x; i <= n; i++) cin >> x, vec2.push_back(x);
    int cnt1 = 0, cnt2 = 0;
    while (vec1 != vec0) prev_permutation(vec1.begin(), vec1.end()), cnt1 ++;
    while (vec2 != vec0) prev_permutation(vec2.begin(), vec2.end()), cnt2 ++;
    cout << abs(cnt1 - cnt2);
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> p(n);
  vector<int> q(n);

  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> q[i];
  }

  if (p > q) {
    swap(p, q);
  }
  int cnt = 0;
  while (p != q) {
    next_permutation(p.begin(), p.end());
    cnt++;
  }
  cout << cnt << "\n";
  return 0;
}