import sys
sys.setrecursionlimit(1000000)
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
import itertools
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e10)
mod = int(1e9+7)

n = int(input())
r = sorted(list(Counter(lmp()).items()))
g = sorted(list(Counter(lmp()).items()))
b = sorted(lmp())
ans = 0
for i,u in r:
    for j,v in g:
        if i < j:break
        L = bisect.bisect_right(b,i-j)
        R = bisect.bisect_right(b,i)
        ans += (R-L)*u*v
print(ans)