#include<bits/stdc++.h>
//#include <atcoder/all>

#define INF 1e9
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a)  (a).begin(),(a).end()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())

using namespace std;
//using namespace atcoder;
using ld = long double;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<int>>;

const ll ZER = 0;
const ll MOD = 1e9 + 7;


ll dp[501][501][2];
int main(){
    // std::cin.tie(0);
    // std::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));
    a.pb(INF * INF);
    ll res = 0;
    rep(i, n){
        int ub = upper_bound(ALL(a), b[i]) - a.begin();
        chmax(ub, i);
        // cout << n << " " << ub << endl;
        res += max(0, n - ub);
    }
    cout << res << endl;
}