#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 a[100010], b[100010];
long long n;
vector<long long> BIT(200020);
void add(long long i, long long x) {
	while (i <= 200020) {
		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);
}
vector<tuple<long long, int, bool>> vec;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		vec.emplace_back(make_tuple(a[i], i, false));
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
		vec.emplace_back(make_tuple(b[i], i, true));
	}
	sort(vec.begin(), vec.end());
	int now = 1;
	for (int i = 0; i < vec.size(); i++) {
		if (i != 0) {
			if (get<0>(vec[i]) != get<0>(vec[i - 1])) {
				now++;
			}
		}
		if (!get<2>(vec[i])) {
			a[get<1>(vec[i])] = now;
		}
		else {
			b[get<1>(vec[i])] = now;
		}
	}
	sort(a, a + n);
	long long ans = 0;
	for (int i = 1; i <= 200000; i++) {
		add(i, 0);
	}
	for (int i = 0; i < n; i++) {
		add(b[i], 1);
		long long co = sum(0, a[i] - 1);
		ans += co;
	}
	cout << ans << endl;
}