def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    n = int(input[ptr])
    ptr +=1
    
    max_val = 3000
    
    # Read red, green, blue arrays
    red = list(map(int, input[ptr:ptr+n]))
    ptr +=n
    green = list(map(int, input[ptr:ptr+n]))
    ptr +=n
    blue = list(map(int, input[ptr:ptr+n]))
    ptr +=n
    
    # Count frequencies
    red_count = [0] * (max_val + 1)
    for num in red:
        red_count[num] +=1
    
    g_count = [0] * (max_val + 1)
    for num in green:
        if num <= max_val:
            g_count[num] +=1
    
    b_count = [0] * (max_val + 1)
    for num in blue:
        if num <= max_val:
            b_count[num] +=1
    
    # Compute prefix sum for b_count
    pre_b = [0] * (max_val + 1)
    pre_b[0] = b_count[0]
    for y in range(1, max_val +1):
        pre_b[y] = pre_b[y-1] + b_count[y]
    
    # Precompute sum_pair[a] for all a from 0 to max_val
    sum_pair = [0] * (max_val +1)
    
    for a in range(max_val +1):
        total =0
        for x in range(a +1):
            g_freq = g_count[x]
            if g_freq ==0:
                continue
            y_min = a - x +1
            if y_min <0:
                y_min =0
            if y_min >a:
                # no y in blue <=a satisfies y >= y_min
                continue
            # sum b_count[y] for y >= y_min and <=a
            sum_b = pre_b[a]
            if y_min >0:
                sum_b -= pre_b[y_min -1]
            total += g_freq * sum_b
        sum_pair[a] = total
    
    # Compute the final answer
    result =0
    for a in range(max_val +1):
        if red_count[a] >0:
            result += red_count[a] * sum_pair[a]
    
    print(result)

if __name__ == "__main__":
    main()