#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long n;
vector<long long> BIT(100010);
void add(long long i, long long x) {
	while (i <= n) {
		BIT[i] += x;
		i += i & -i;
	}
}
long long csum(long long i) {
	long long count = 0;
	while (i > 0) {
		count += BIT[i];
		i -= i & -i;
	}
	return count;
}
long long sum(long long l, long long r) {
	return csum(r) - csum(l - 1);
}
long long a[100010];
long long b[100010];
long long co[100010];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
		co[b[i]] = i + 1;
	}
	for (int i = 0; i < n; i++) {
		b[i + 1] = co[a[i]];
	}
	for (int i = 1; i <= n; i++) {
		add(i, 0);
	}
	long long ans = 0;
	for (int i = 1; i <= n; i++) {
		ans += (i - 1) - sum(0, b[i]);
		add(b[i], 1);
	}
	cout << ans << endl;
	return 0;
}