#include <bits/stdc++.h>
using namespace std;

template <typename T>
struct BinaryIndexedTree {
    int N;
    vector<T>bit;
    
    BinaryIndexedTree() {};
    
    BinaryIndexedTree(int x) {
        N = x;
        bit.resize(x+1);
    }
    
    void add(int x,T y) {
        while(x <= N) {
            bit[x] += y;
            x += x&-x;
        }
    }
    
    T sum(int x) {
        T res = 0;
        while(x) {
            res += bit[x];
            x -= x&-x;
        }
        return res;
    }
    
    T sum(int l, int r) {//[l,r]
        return sum(r)-sum(l-1);
    }
};

int main() {
    int N;
    cin >> N;
    vector<int>a(N),b(N),c;
    for(int i = 0; i < N; i++) {
        cin >> a[i];
        c.push_back(a[i]);
    }
    for(int i = 0; i < N; i++) {
        cin >> b[i];
        c.push_back(b[i]);
    }
    sort(a.begin(),a.end());
    sort(c.begin(),c.end());
    c.erase(unique(c.begin(),c.end()),c.end());
    BinaryIndexedTree<int>bit(c.size());
    long long ans = 0;
    for(int i = 0; i < N; i++) {
        int it1 = lower_bound(c.begin(),c.end(),a[i])-c.begin();
        int it2 = lower_bound(c.begin(),c.end(),b[i])-c.begin();
        it1++;
        it2++;
        bit.add(it2,1);
        ans += bit.sum(1,it1-1);
    }
    cout << ans << endl;
}