#pragma GCC optimize("Ofast")
#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];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}
	sort(a, a + n);
	vector<long long> vec;
	long long ans = 0;
	for (int i = 0; i < n; i++) {
		vec.emplace_back(b[i]);
		sort(vec.begin(), vec.end());
		auto itr = lower_bound(vec.begin(), vec.end(), a[i]);
		ans += int(itr - vec.begin());
	}
	cout << ans << endl;
}