#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=99999997; 
int ans=0;
struct node{
	int data;
	int id;
}; 
int n;
node a[1000005],b[1000005];
int x[1000005],c[1000005];
bool cmp(node x,node y)
{
	return x.data<y.data;
}
void my_sort(int left,int right)
{
	if(left==right) return;
	int mid=(left+right)/2,i=left,j=mid+1,flag=left;
	my_sort(left,mid);
	my_sort(mid+1,right);
    while(i<=mid&&j<=right)
    {
    	if(x[i]<=x[j])
    		c[flag++]=x[i++];
    	else
    	{
    		c[flag++]=x[j++];
			ans+=(mid-i+1)%mod;
		}
	}
    while(i<=mid) c[flag++]=x[i++];
    while(j<=right) c[flag++]=x[j++];
    for(int p=left;p<=right;p++) x[p]=c[p];
}
signed main()
{
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i].data);
		a[i].id=i;
	}
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&b[i].data);
		b[i].id=i;
	}
	sort(a+1,a+n+1,cmp);
	sort(b+1,b+n+1,cmp);
	for(int i=1;i<=n;i++)
		x[b[i].id]=a[i].id;
	my_sort(1,n);
	printf("%lld",ans);
	return 0;
}