#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)

template <typename T>
class fenwick_tree {
  vector<T> data;
public:
  fenwick_tree() {}
  // manage data in [1, n]
  fenwick_tree(int n) : data(n + 1) {}

  void init() {
    fill(data.begin(), data.end(), 0);
  }

  // return sum in [1, i]
  T sum(int i){
    T s = 0;
    while(i > 0){
      s += data[i];
      i -= i & -i;
    }
    return s;
  }

  // return sum in [l, r]
  T sum(int l, int r) {
    return sum(r) - sum(l-1);
  }
  
  void add(int i, T x){
    while(i < (int)data.size()){
      data[i] += x;
      i += i & -i;
    }
  }
};

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

  int n;
  cin >> n;

  vector<int> a(n), b(n);
  vector<int> v(2*n);

  for (int i = 0; i < n; i++) {
    cin >> a[i];
    v[i] = a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> b[i];
    v[n+i] = b[i];
  }

  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  int m = v.size();

  map<int, int> idx;
  for (int i = 0; i < m; i++)
    idx[v[i]] = i;
  
  for (int i = 0; i < n; i++) {
    a[i] = idx[a[i]] + 1;
    b[i] = idx[b[i]] + 1;
  }
  
  sort(a.begin(), a.end());
  
  fenwick_tree<long long> tree(m);
  long long ret = 0;
  for (int i = 0; i < n; i++) {
    tree.add(b[i], 1);
    ret += tree.sum(a[i] - 1);
  }
  cout << ret << endl;
  
  return 0;
}