"""


"""

import bisect
n = int(input())

r = list(map(int,input().split()))
g = list(map(int,input().split()))
b = list(map(int,input().split()))

MM = 3001
rx = [0] * MM
gx = [0] * MM
bx = [0] * MM

for i in r:
    rx[i] += 1
for i in g:
    gx[i] += 1
for i in b:
    bx[i] += 1

for i in range(MM-1):
    bx[i+1] += bx[i]

ans = 0
for i in range(MM):
    for j in range(i+1):

        minlen = i - j
        ans += (bx[i] - bx[minlen]) * rx[i] * gx[j]

print (ans)