n = int(input())
L = list(map(int,input().split()))
print(sum([1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n)]))  n = int(input()) n int(input()) int input() input L = list(map(int,input().split())) L list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split 1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n) for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n) i range(0,n) range 0 n for j in range(i+1,n) for k in range(j+1,n) j range(i+1,n) range i+1 i 1 n for k in range(j+1,n) k range(j+1,n) range j+1 j 1 n for k in range(j+1,n) 1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) L[i]==L[j] or L[i]==L[k] or L[j]==L[k] L[i]==L[j] or L[i]==L[k] L[i]==L[j] L[i] L i L[j] L j L[i]==L[k] L[i] L i L[k] L k L[j]==L[k] L[j] L j L[k] L k L[i]+L[j] > L[k] L[i]+L[j] L[i] L i L[j] L j L[k] L k L[i]+L[k] > L[j] L[i]+L[k] L[i] L i L[k] L k L[j] L j L[j]+L[k] > L[i] L[j]+L[k] L[j] L j L[k] L k L[i] L i 1 0 print(sum([1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n)])) print sum([1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n)]) sum [1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n)] L = list(map(int,input().split())) list(map(int,input().split())) L n = int(input()) int(input()) n
n = int(input())
L = list(map(int,input().split()))
print(sum([1 if not(L[i]==L[j] or L[i]==L[k] or L[j]==L[k]) and L[i]+L[j] > L[k] and L[i]+L[k] > L[j] and L[j]+L[k] > L[i] else 0 for i in range(0,n) for j in range(i+1,n) for k in range(j+1,n)])) 