class LongSegmentTree(n: Int, private val init: Long, private val func: (Long, Long) -> Long) {
    private var size = 1
    private var segTree: LongArray

    init {
        while (size < n) {
            size *= 2
        }

        segTree = LongArray(size * 2 - 1) { init }
    }

    // 指定要素を更新
    fun update(x: Int, value: Long) {
        var tmp = x + size - 1

        segTree[tmp] = value
        while (tmp > 0) {
            tmp = (tmp - 1) / 2
            segTree[tmp] = func(segTree[2 * tmp + 1], segTree[2 * tmp + 2])
        }
    }

    // [a, b)の関数適用結果を取得
    // bが開区間であることに注意
    fun get(a: Int, b: Int, k: Int = 0, l: Int = 0, r: Int = size): Long {
        if (r <= a || b <= l) {
            return init
        }
        if (a <= l && r <= b) {
            return segTree[k]
        }

        val vl = get(a, b, 2 * k + 1, l, (l + r) / 2)
        val vr = get(a, b, 2 * k + 2, (l + r) / 2, r)

        return func(vl, vr)
    }

    // 指定要素を取得
    fun getElem(x: Int): Long = segTree[x + size - 1]
}

fun main() {
    val builder = StringBuilder()

    val n = readInputLine().toInt()

    val allSet = sortedSetOf<Int>()

    val aList = readInputLine().split(" ").map { it.toInt() }.sorted()
    val bArr = readInputLine().split(" ").map { it.toInt() }.toIntArray()

    for (a in aList) {
        allSet.add(a)
    }
    for (b in bArr) {
        allSet.add(b)
    }

    val item2Map = mutableMapOf<Int, Int>()

    for ((i, a) in allSet.withIndex()) {
        item2Map[a] = i
    }

    val segTree = LongSegmentTree(2 * n, 0L, Long::plus)

    var ans = 0L

    for ((i, a) in aList.withIndex()) {
        val bIndex = item2Map[bArr[i]]!!
        val aIndex = item2Map[a]!!

        segTree.update(bIndex, segTree.getElem(bIndex) + 1L)

        ans += segTree.get(0, aIndex)
    }

    builder.appendln(ans)

    print(builder.toString())
}

fun readInputLine(): String {
    return readLine()!!
}