#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<ll> A(N), B(N);
    rep(i, N) { cin >> A[i]; }
    rep(i, N) { cin >> B[i]; }

    sort(all(A));
    ll sum = 0;

    vector<ll> a, b;
    rep(i, N) {
        sum += lower_bound(all(a), A[i]) - a.begin();
        b.push_back(B[i]);
        sort(all(b));
        sum += lower_bound(all(b), A[i]) - b.begin();
        if (b.size() == 300) {
            a.insert(a.end(), all(b));
            sort(all(a));
            b.clear();
        }
    }

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