from bisect import bisect_left

N = int(input())
INF = 10**18
R = [0]+list(map(int,input().split()))+[INF]
G = list(map(int,input().split()))
B = list(map(int,input().split()))
R.sort()
ans = 0
for i in range(N):
  for j in range(N):
    g,b = G[i],B[j]
    h = g+b
    bis = bisect_left(R,h)
    bis -= 1
    a = max(bisect_left(R,g),bisect_left(R,b))-1
    ans += bis-a

print(ans)