#include <iostream>
#include <vector>
#include <map>
using namespace std;
using ll = long long int;

class BIT{
private:
    vector<ll> a;
    int n;
public:
    BIT(int len){
        a = vector<ll>(len+1, 0);
        n = len;
    }

    void add(int ind, ll x){
        ind++;
        while(ind <= n){
            a[ind] += x;
            ind += ind & (-ind);
        }
    }

    ll sum_sub(int end){
        end++;
        ll ans = 0;
        while(end > 0){
            ans += a[end];
            end -= end & (-end);
        }
        return ans;
    }

    ll sum(int start, int end){
        return sum_sub(end)-sum_sub(start-1);
    }
};

int main(){
    int n;
    cin >> n;
    vector<int> a0(n), b(n);
    for(auto &p: a0) cin >> p;
    for(auto &p: b) cin >> p;

    map<int, int> memo;
    for(int i = 0; i < n; i++) memo[b[i]] = i;

    vector<int> a(n);
    for(int i = 0; i < n; i++) a[i] = memo[a0[i]];

    BIT data(n);
    ll ans = 0;
    for(int i = 0; i < n; i++){
        data.add(a[i], 1);
        ans += data.sum(a[i], n-1)-1;
    }

    cout << ans << endl;
    return 0;
}