local band = bit.band
local mfl = math.floor
local function comp(a, b)
  return a < b
end

local function lower_bound(ary, x)
  local num = #ary
  if num == 0 then return 1 end
  if not comp(ary[1], x) then return 1 end
  if comp(ary[num], x) then return num + 1 end
  local min, max = 1, num
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if comp(ary[mid], x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local FenwickTree = {}
FenwickTree.create = function(self, n)
  self.n = n
  self.v = {}
  for i = 1, n do self.v[i] = 0 end
end
FenwickTree.add = function(self, pos, val)
  while pos <= self.n do
    self.v[pos] = self.v[pos] + val
    pos = pos + band(pos, -pos)
  end
end
FenwickTree.sum = function(self, r)
  local ret = 0
  while 0 < r do
    ret = ret + self.v[r]
    r = r - band(r, -r)
  end
  return ret
end
FenwickTree.new = function(n)
  local obj = {}
  setmetatable(obj, {__index = FenwickTree})
  obj:create(n)
  return obj
end

local n = io.read("*n")
local a = {}
local b = {}
for i = 1, n do
  a[i] = io.read("*n")
end
local bmap = {}
for i = 1, n do
  b[i] = io.read("*n")
  bmap[b[i]] = true
end
table.sort(a)
local buniq = {}
for k, _u in pairs(bmap) do
  table.insert(buniq, k)
end
table.sort(buniq)
local bn = #buniq
for i = 1, bn do
  bmap[buniq[i]] = i
end
local fw = FenwickTree.new(bn)
local ret = 0
for i = 1, n do
  local bi = b[i]
  local bpos = bmap[bi]
  fw:add(bpos, 1)
  local lb = lower_bound(buniq, a[i])
  if 1 < lb then
    ret = ret + fw:sum(lb - 1)
  end
end
print(ret)