#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;

class BIT {
public:
	ll n; //データの長さ
	vector<ll> bit; //データの格納先
	BIT(ll n) :n(n), bit(n + 1, 0) {} //コンストラクタ



	void add(ll i, ll x) {
		if (i == 0) return;
		for (ll k = i; k <= n; k += (k & -k)) {
			bit[k] += x;
		}
	}

	ll sum(ll i) {
		ll s = 0;
		if (i == 0) return s;
		for (ll k = i; k > 0; k -= (k & -k)) {
			s += bit[k];
		}
		return s;
	}

	
};

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	VI A(N), B(N), T(N * 2);
	REP(i, N) {
		cin >> A[i];
		T[i] = A[i];
	}
	REP(i, N) {
		cin >> B[i];
		T[i + N] = B[i];
	}
	SORT(T);
	map<int, int>mp;
	int k = 0, K = 0;
	while (k < 2 * N) {
		while (k != 2 * N - 1 && T[k] == T[k + 1]) k++;
		mp[T[k]] = K++;
		k++;
	}
	REP(i, N) {
		A[i] = mp[A[i]];
		B[i] = mp[B[i]];
		//cout << A[i] << " " << B[i] << endl;
	}
	SORT(A);
	int ans = 0;
	BIT bi(K+2);
	REP(i, N) {
		bi.add(B[i] + 1, 1);
		ans += bi.sum(A[i]);
		//cout << ans << endl;
	}
	
	cout << ans << endl;
	return 0;
}