#include <bits/stdc++.h>
using namespace std;
using ll=long long;

template< typename T >
struct BinaryIndexedTree {
  vector< T > data;

  BinaryIndexedTree(int sz) {
    data.assign(++sz, 0);
  }

  T sum(int k) {
    T ret = 0;
    for(++k; k > 0; k -= k & -k) ret += data[k];
    return (ret);
  }

  void add(int k, T x) {
    for(++k; k < data.size(); k += k & -k) data[k] += x;
  }
};


int main() {
    ll N;
    cin >> N;
    vector<ll> A(N),B(N);
    for(int i=0;i<N;i++){
        cin >> A[i];
    }
    unordered_map<ll,ll> Bmp; 
    for(int i=0;i<N;i++){
        ll B;
        cin >> B;
        Bmp[B] = i;
    }
    unordered_map<ll,ll> revA;
    for(int i=0;i<N;i++){
        A[i] = Bmp[A[i]];
        revA[A[i]] = i;
    }

    ll ans =0;
    BinaryIndexedTree<ll> bit(N+5);
    for(int i=0;i<N;i++){
        ans += (bit.sum(N-1) -bit.sum(revA[i]));
        bit.add(revA[i],1);
    }
    
    cout << ans << endl;


    return 0;
}