import java.util.*

fun main(args: Array<String>) {
  val sc = Scanner(System.`in`)
  val n = sc.nextInt()
  val p = (1..n).map { sc.nextInt() }
  val q = (1..n).map { sc.nextInt() }

  println(abc150c(n, p, q))
}

private fun abc150c(n: Int, p: List<Int>, q: List<Int>): Int {
  val pStr = p.joinToString("")
  val qStr = q.joinToString("")
  val array = (1..n).map { it }.toIntArray()

  var count = 1
  var a = 0
  var b = 0
  do {
    val arrayStr = array.joinToString("")
    if (arrayStr == pStr) a = count
    if (arrayStr == qStr) b = count

    count++
  } while (findNextPermutation(array))

  return Math.abs(a - b)
}

private fun findNextPermutation(array: IntArray): Boolean {
  if (array.size <= 1) return false

  var last = array.size - 2
  while (last >= 0) {
    if (array[last] < array[last + 1]) break
    last--
  }
  if (last < 0) return false

  var nextGreater = array.size - 1
  var i = array.size - 1
  while (i > last) {
    if (array[i] > array[last]) {
      nextGreater = i
      break
    }
    i--
  }
  swap(array, nextGreater, last)
  reverse(array, last + 1, array.size - 1)

  return true
}

private fun swap(array: IntArray, left: Int, right: Int): IntArray {
  val tmp = array[left]
  array[left] = array[right]
  array[right] = tmp
  return array
}

private fun reverse(array: IntArray, left: Int, right: Int): IntArray {
  var l = left
  var r = right
  while (l < r) {
    val tmp = array[l]
    array[l++] = array[r]
    array[r--] = tmp
  }
  return array
}
