#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll inf=144499999994;
ll mod=1000000007;
ll op(ll a,ll b){
    return a+b;
}
ll e(){
    return 0;
}
int main(){
    ll n;
    cin >> n;
    vector<ll>a(n),b(n);
    vector<ll>c;
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
        c.push_back(a[i]);
    }
    sort(a.begin(),a.end());
    for (ll i = 0; i < n; i++)
    {
        cin >> b[i];
        c.push_back(b[i]);
    }
    sort(c.begin(),c.end());
    c.erase(unique(c.begin(), c.end()), c.end());
    map<ll,ll>memo;
    for (ll i = 0; i < c.size(); i++)
    {
        memo[c[i]]=i;
    }
    vector<ll>x(c.size(),0);
    segtree<ll,op,e>seg(x);
    ll ans=0;
    for (ll i = 0; i < n; i++)
    {
        seg.set(memo[b[i]],seg.get(memo[b[i]])+1);
        ans+=seg.prod(0,memo[a[i]]);
    }
    cout << ans << endl;
}