#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll n; cin >> n;
    int a[n] = {};
    rep(i,n) cin >> a[i];
    int b[n];
    rep(i,n) cin >> b[i];
    sort(a,a+n);
    ll cnt = 0;
    priority_queue<int,vector<int>,greater<int>> que;
    ll ans = 0;
    rep(i,n){
        que.push(b[i]);
        while(!que.empty()){
            if(que.top() < a[i]){
                cnt++;
                que.pop();
            }else{
                break;
            }
        }
        ans += cnt;
    }
    cout << ans << endl;
    return 0;
}