import java.io._
import java.util.StringTokenizer
import scala.util.control.Breaks.{breakable,break}

object Main extends App {
  val in = new InputReader(System.in)
  val pw = new PrintWriter(System.out)

  val N = in.next().toInt
  val A1 = new Array[Int](N)
  val B1 = new Array[Int](N)
  val C1 = new Array[Int](N)

  for(i <- 0 until N)
    A1(i) = in.next().toInt
  for(i <- 0 until N)
    B1(i) = in.next().toInt
  for(i <- 0 until N)
    C1(i) = in.next().toInt

  val A = 0 +: A1
  val B = 0 +: B1.sorted.reverse
  val C = 0 +: C1.sorted.reverse


  // process //
  def check(n: Int, obje: Int, ar: Array[Int]): Boolean = {
    ar(n) > obje
  }

  // 条件を満たす最大の値を返す
  def binarySearch(min: Int, max: Int, obje: Int, ar: Array[Int]): Int = {
    val mid: Int = (max + min) / 2
      (max - min) match{
      case 0 | 1 =>
        check(max, obje, ar) match{
          case true  => max
          case false => min
        }
      case _ =>
        (check(mid, obje, ar)) match{
          case true  => binarySearch(mid, max, obje, ar)
          case false => binarySearch(min, mid, obje, ar)
        }
    }
  }

  //
  val dpB = new Array[Int](N+1)
  for(i <- 1 to N) {
    if(B(i) < C(1)) {
      dpB(i) = binarySearch(1, N, B(i), C)
    }
  }

  // imos
  for(i <- 1 to N-1)
    dpB(i+1) += dpB(i)

  var ans = 0L
  for(i <- 1 to N) {
    if(A(i) < B(1)) {
      val bi = binarySearch(1, N, A(i), B)

      ans += dpB(bi)
    }
  }

  println(ans)
}


class InputReader(stream: InputStream) {
  private val reader = new BufferedReader(new InputStreamReader(stream))
  private var tokenizer: StringTokenizer = new StringTokenizer(reader.readLine())
  def next(): String = {
    while (!tokenizer.hasMoreTokens()) {
      tokenizer = new StringTokenizer(reader.readLine())
    }
    tokenizer.nextToken()
  }
}
