#include <bits/stdc++.h>

using namespace std;

template <typename T>
class BIT {
  vector<T> bit;
public:
  BIT() {}
  // manage data in [1, n]
  BIT(int n) : bit(n + 1) {}
  
  void init() {
    fill(bit.begin(), bit.end(), 0);
  }
  
  // return sum in [1, i]
  T sum(int i){
    T s = 0;
    while(i > 0){
      s += bit[i];
      i -= i & -i;
    }
    return s;
  }
  
  // return sum in [l, r]
  T sum(int l, int r) {
    return sum(r) - sum(l-1);
  }
  
  void add(int i, T x){
    while(i < (int)bit.size()){
      bit[i] += x;
      i += i & -i;
    }
  }
};

#define REP(i,n) for(int i=0; i<(int)(n); i++)

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<int> a(n), b(n);

  REP (i, n) {
    int tmp; cin >> tmp;
    a[tmp-1] = i;
  }
  REP (i, n) {
    cin >> b[i];
    --b[i];
    b[i] = a[b[i]];
  }

  long long ret = 0;
  BIT<long long> tree(n);
  REP (i, n) {
    ret += i - tree.sum(b[i]+1);
    tree.add(b[i]+1, 1);
  }
  cout << ret << endl;
  
  return 0;
}