#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

template<typename T>
struct BIT{
    private:
    vector<T> array;
    const int length;
    
    public:

    BIT(int _n) : array(_n+1),length(_n){}

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

    T sum(int i,int j){
        T ret1 = sum(i-1);
        T ret2 = sum(j);
        return ret2-ret1;
    }

    void add(int i,T x){
        while(i<=length){
            array[i]+=x;
            i += i&(-i);
        }
    }
};


int main(void){
	int n;
	cin>>n;
	vector<int>a(n),b(n);
	map<int,int>mp;
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	for(int i=0;i<n;i++){
		int c;
		cin>>c;
		mp[c]=i+1;
	}
	for(int i=0;i<n;i++){
		b[i]=mp[a[i]];
	}
	BIT<ll>bit = BIT<ll>(n);
	ll ans = 0;
	for(int i=0;i<n;i++){
		ans+=i-bit.sum(b[i]);
		bit.add(b[i],1);
	}
	cout<<ans<<endl;
	return 0;
}