#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

template<class T>
struct FenwickTree{
  int n;
  vector<T> tree;
public:
  FenwickTree(int n):n(n), tree(n+1, T(0)){}
  void add(int i, T value){
    for(; i<n; i|=i+1) tree[i] += value;
  }
  T sum(int i){
    T s = 0;
    for(; i>=0; i=(i&i+1)-1) s += tree[i];
    return s;
  }
};

int main(){
  int N;
  cin >> N;
  vector<int> v, w;
  map<int,int> memo;
  rep(i,N){
    int a;
    cin >> a;
    v.push_back(a);
    memo[a] = 1;
  }
  rep(i,N){
    int a;
    cin >> a;
    w.push_back(a);
    memo[a] = 1;
  }

  map<int,int> val2id;
  int idx = 0;
  FOR(it,memo){
    val2id[it->first] = idx;
    idx++;
  }
  
  sort(ALLOF(v));

  FenwickTree<int> ft(val2id.size()+5);
  
  ll ret = 0;
  rep(i,N){
    ft.add(val2id[w[i]], 1);
    if(val2id[v[i]] > 0){
      ret += ft.sum(val2id[v[i]]-1);
    }
  }

  cout << ret << endl;
  
  return 0;
}