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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;
    auto a = vec<int>(uns, n);
    auto b = vec<int>(uns, n);
    for (auto &e : a) cin >> e;
    for (auto &e : b) cin >> e;
    sort(begin(a), end(a));

    int64_t ans = 0;

    auto imos = vec<int>(0, n + 2);
    for (int i = 0; i < n; ++i) {
        int d = distance(begin(a), upper_bound(begin(a), end(a), b[i]));
        imos[max(i, d)] += 1;
        imos[i + 1] += imos[i];
        ans += imos[i];
    }

    cout << ans << endl;
}