#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

struct FenwickTree{//入力は0インデックス
  vector<ll> d;
  FenwickTree(int n) : d(n, 0){}
  bool _addD(int index, ll add){
    if(index - 1 < 0 || index - 1 >= (int)d.size()) return false;
    d.at(index-1) += add;
    return true;
  }
  void add(int index, int n){
    index++;
    while(index != 0){
      bool ret = _addD(index, n);
      if(ret == false) break;
      index += index & (-index);
    }
  }
  ll refer(int index){
    index++;
    ll ret = 0;
    while(index != 0){
      if(index > (int)d.size() || index <= 0) break;
      ret += d.at(index-1);
      index -= index & (-index);
    }
    return ret;
  }
  ll refer(int l, int r){//[l, r]
    return refer(r) - refer(l-1);
  }
};


int main(){
  int n;
  cin >> n;
  vector<int> v(n);
  vector<int> a(n);
  rep(i, n){
    int in;
    cin >> in;
    a.at(i) = in;
  }
  rep(i, n){
    int in;
    cin >> in;
    v.at(in-1) = i;
  }
  rep(i, n){
    a.at(i) = v.at(a.at(i)-1);
    // cerr << a.at(i) << " ";
  }
  // cerr << endl;

  FenwickTree ft(n);
  ll ans = 0;
  rep(i, n){
    ans += i - ft.refer(a.at(i));
    // cerr << i << " " << a.at(i) << endl;
    ft.add(a.at(i), 1);
  }
  cout << ans << endl;
  return 0;
}