#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int N;
int bit[100005];
vector<int> arr(100005);

int sum(int i) {
  int s = 0;
  while(i>0) {
    s += bit[i];
    i -= i & -i;
  }
  return s;
}

void add(int i, int x) {
  while(i<=N) {
    bit[i] += x;
    i += i & -i;
  }
}

void solve() {
  ll ans = 0;
  for(int j=0;j<N;++j) {
    ans += j - sum(arr[j]);
    add(arr[j], 1);
  }
  cout<<ans<<endl;
}

int main() {
  cin>>N;
  map<int, int> amap;
  int a;
  for(int i=0;i<N;++i) {
    cin>>a;
    amap[a] = i+1;
  }
  int b;
  for(int i=0;i<N;++i) {
    cin>>b;
    arr[i] = amap[b];
  }
  solve();
}