#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,k,n) for(int i=(k);i<(n);i++)
#define all(a) (a).begin(),(a).end()
#define output(x,y) cout << fixed << setprecision(y) << x << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
ll upper = MOD + MOD;
ll under = -upper;
ll UPPER = MOD * MOD;
ll UNDER = -UPPER;
const long double pi = 3.141592653589793;
template<class T>
struct BIT {
	VE<T> d;
	int n;
	BIT(int n = 0) : n(n), d(n + 1, 0) {}
	void add(int i, T x) {
		for (i++; i <= n; i += i & -i) d[i] += x;
	}
	T sum(int i) {
		int tmp = 0;
		for (i++; i; i -= i & -i) tmp += d[i];
		return tmp;
	}
};
int main() {
	int n;
	cin >> n;
	V a(n), b(n);
	V pos(n);
	rep(i, n) {
		cin >> a[i];
		a[i]--;
	}
	rep(i, n) {
		cin >> b[i];
		b[i]--;
		pos[b[i]] = i;
	}
	V c(n);
	rep(i, n) {
		c[i] = pos[a[i]];
	}
	ll ans = 0;
	BIT<ll> BIT(n);
	rep(i, n) {
		ans += i - BIT.sum(c[i]);
		BIT.add(c[i], 1);
	}
	cout << ans << endl;
	return 0;
}