// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
        os << vec[i] << " \n"[i + 1 == vec_len];
    }
    return os;
}

// Fenwick Tree
#include <vector>

template <typename T>
class FenwickTree {
    int length;
    std::vector<T> node;
    
public:
    FenwickTree (int n) : length(n), node(length + 1, 0) {
        assert(n >= 0);
    }
    
    void add(int idx, T val) {
        assert(idx >= 0 && idx < length);
        ++idx;
        while (idx <= length) {
            node[idx] += val;
            idx += (idx & (-idx));
        }
    }
    
    T getsum(int idx) {
        assert(idx >= 0 && idx <= length);
        T ans = T(0);
        while (idx) {
            ans += node[idx];
            idx -= (idx & (-idx));
        }
        return ans;
    }
};

// Main
int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    cin >> a >> b;
    
    vector<int> vec(2 * n);
    rep(i, n) {
        vec[i] = a[i];
        vec[i + n] = b[i];
    }
    sort(all(vec));
    vec.erase(unique(all(vec)), vec.end());
    rep(i, n) {
        a[i] = lower_bound(all(vec), a[i]) - vec.begin();
        b[i] = lower_bound(all(vec), b[i]) - vec.begin();
    }
    
    sort(all(a));
    FenwickTree<int> ft(2 * n);
    ll ans = 0;
    rep(i, n) {
        ft.add(b[i], 1);
        ans += ft.getsum(a[i]);
    }
    cout << ans << "\n";
}