#include <bits/stdc++.h>
using namespace std;
long long inversion_number(vector<int> &p){
	int N = p.size();
	long long ans = 0;
	vector<int> bit(N + 1, 0);
	for (int i = 0; i < N; i++){
		ans += i;
		int j = p[i];
		while (j > 0){
			ans -= bit[j];
			j -= j & -j;
		}
		j = p[i];
		while (j <= N){
			bit[j]++;
			j += j & -j;
		}
	}
	return ans;
}
int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++){
    cin >> a[i];
    a[i]--;
  }
  vector<int> b(n);
  for (int i = 0; i < n; i++){
    cin >> b[i];
    b[i]--;
  }
  vector<int> A(n);
  for (int i = 0; i < n; i++){
    A[a[i]] = i;
  }
  for (int i = 0; i < n; i++){
    b[i] = A[b[i]] + 1;
  }
  cout << inversion_number(b) << endl;
}