#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}
class BIT{
        int n;
  		unordered_map<int, int> bitree;
    public:
    	BIT(unsigned long _n){
          n = _n;
        }
    	void add(ll id, ll x){
          while(id <= n){
            bitree[id] += x;
            id += id & -id;
          }
        }
    	ll sum(ll id){
          ll temp = 0;
          while(id > 0){
            temp += bitree[id];
            id -= id & -id;
          }
          return temp;
        }
  };
int main(){
    cin>>N;
    vec a(N), b(N);
    rep(i, N) cin>>a[i];
    rep(i, N) cin>>b[i];
    sort(ALL(a));
    BIT bit((int)(1e+9) + 1);
    ll res(0);
    rep(i, N){
        bit.add(b[i], 1);
        res += bit.sum(a[i] - 1);
    }
    cout<<res<<endl;
}