#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e9+7;


template<typename T>

struct BIT {
  int n;
  vector<T> d;

  BIT(T n=0):n(n),d(n+1) {}

  void add(int i, T x=1) {
    for (i++; i <= n; i += i&-i) {
      //「i += i&-i」は区間を表すindexに最下位ビットを足したもの
      //「-i = ~i-1」が成り立つ
      d[i] += x;
    }
    //更新
  }

  T sum(int i) {
    T x = 0;
    for (i++; i; i -= i&-i) {
      x += d[i];
    }
    //iが0になったら終わり
    //取得
    return x;
  }

};

int main(){
    ll n;
    cin >> n;
    vector<ll> a(n),b(n);
    rep(i,n){
        ll x;
        cin >> x;
        x--;
        a[x]=i;
    }
    rep(i,n){
        ll x;
        cin >> x;
        x--;
        b[i]=a[x];
    }
    ll ans=0;
    BIT<ll> bit(n);
    rep(j,n){
        ans+=j-bit.sum(b[j]);
        bit.add(b[j],1LL);
    }
    cout << ans << endl;
    return 0;
}