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

template <typename T>
struct binary_indexed_tree{
	int N;
	vector<T> BIT;
	binary_indexed_tree(int n){
		N = 1;
		while (N < n){
			N *= 2;
		}
		BIT = vector<T>(N + 1, 0);
	}
	void add(int i, T x){
		i++;
		while (i <= N){
			BIT[i] += x;
			i += i & -i;
		}
	}
	T sum(int i){
		T ans = 0;
		while (i > 0){
			ans += BIT[i];
			i -= i & -i;
		}
		return ans;
	}
};

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

    int N; cin >> N;
    vector<int> a(N);
    rep(i,N) cin >> a[i];
    sort(a.begin(), a.end());

    vector<int> b(N);
    rep(i,N) cin >> b[i];

    vector<int> v;
    rep(i,N){
        v.emplace_back(a[i]);
        v.emplace_back(b[i]);
    }
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    int Vsize = v.size();
    map<int,int> mp;
    rep(i,Vsize) mp[v[i]] = i;
    rep(i,N){
        a[i] = mp[a[i]];
        b[i] = mp[b[i]];
    }

    ll ans = 0;
    binary_indexed_tree<int> BIT(Vsize);
    rep(i,N){
        BIT.add(b[i], 1);
        ans += BIT.sum(a[i]);
    }

    cout << ans << '\n';
}