// 1-indexed binary indexed tree
class BIT(n: Int, private val init: Long = 0L) {
    private var size = 1
    private var arr: LongArray

    init {
        while (size < n) {
            size *= 2
        }
        arr = LongArray(size + 1) { init }
    }

    // index(1-indexed)にvalueを加算
    fun add(index: Int, value: Long) {
        var i = index
        while (i <= size) {
            arr[i] += value
            i += i and (-i)
        }
    }

    // [l, r]の総和を求める
    fun sum(l: Int, r: Int): Long {
        // [1, i]の総和を求める副関数
        fun subFunc(i: Int): Long {
            var current = i
            var ret = 0L
            while (current > 0) {
                ret += arr[current]
                current -= current and (-current)
            }
            return ret
        }

        return subFunc(r) - subFunc(l - 1)
    }
}

fun main() {
    val builder = StringBuilder()

    val n = readInputLine().toInt()

    val allSet = sortedSetOf<Int>()

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

    val item2Map = mutableMapOf<Int, Int>()

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

    val bit = BIT(2 * n)

    var ans = 0L

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

        bit.add(bIndex + 1, 1L)

        ans += bit.sum(0, aIndex)
    }

    builder.appendln(ans)

    print(builder.toString())
}

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