#include <iostream>
#include <fstream>
using namespace std;
int main() {
    ifstream f;
    ofstream g;
    f.open("permutariab.in");
    g.open("permutariab.out");
    int n;
    f>>n;
    int a[n],b[n],c[n];
    for (int i=0;i<n;i++)
    {
        f>>a[i];
    }
    for (int i=0;i<n;i++)
    {
        f>>b[i];
    }

    int contor=0;
    for(int i=0;i<n;i++)
    {
        int j=0;
        while(a[j]!=b[i])
            j++;
        c[contor++]=j+1;
    }
    int sem=contor=0;
    while(sem==0){
        sem=1;
        for(int i=0;i<n-1;i++)
        if (c[i]>c[i+1]){
            contor++;
            swap(c[i],c[i+1]);
            sem=0;
        }

    }
    g<<contor;
    return 0;
}