#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N;
int A[100000];
int B[100000];

int main() {
	cin >> N;
	rep(i, N) cin >> A[i];
	rep(i, N) cin >> B[i];

	sort(A, A + N);

	LL ans = 0;

	rep(i, N) {
		int l = i, r = N + 1;
		while (l + 1 < r) {
			int m = (l + r) / 2;
			if (B[i] < A[m - 1]) r = m;
			else l = m;
		}
		ans += N - l;
	}


	cout << ans << endl;

	return 0;
}