#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

int main(){
    ll n;
    cin >> n;
    vector<int> a(n),b(n);
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    sort(a.begin(),a.end());

    ll sum = 0;
    rep(i,n){
        int l = i-1,r = n;
        while(r - l > 1){
            int m = (l + r)/2;
            if(a[m] > b[i]) r = m;
            else l = m;
        }
        sum += n - r;
    }

    cout << sum << endl;
    return 0;
}