#include<bits/stdc++.h>

using namespace std;
using ll = long long;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> st;

int main()
{
	int N; cin >> N;
	vector<int> A(N), B(N);
	for(int i = 0; i < N; i++)cin >> A[i];
	for(int i = 0; i < N; i++)cin >> B[i];
	sort(A.begin(), A.end());
	ll sum = 0;

	for(int i = 0; i < N; i++) {
		st.insert({B[i], i});
		sum += st.order_of_key({A[i], 0});
	}
	cout << sum << endl;

}