import math
import collections
import itertools

def YesNo(Bool):
    if(Bool):
        print("Yes")
    else:
        print("No")
    return

def resolve():

    N=int(input())
    L=list(map(int,input().split()))

    cnt=0
    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
    print(cnt)
resolve() import math math import collections collections import itertools itertools def YesNo(Bool):
    if(Bool):
        print("Yes")
    else:
        print("No")
    return YesNo if(Bool):
        print("Yes")
    else:
        print("No")
     Bool print("Yes") print "Yes" print("No") print "No" return Bool Bool def resolve():

    N=int(input())
    L=list(map(int,input().split()))

    cnt=0
    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
    print(cnt) resolve 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 cnt=0 cnt 0 for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
     i range(N) range N for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
     j range(i+1,N) range i+1 i 1 N for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
     k range(j+1,N) range j+1 j 1 N if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
     (L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i]) (L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k]) (L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k]) L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] L[i]!=L[j] and 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 i L[j]+L[k] L[j] L j L[k] L k L[j]<L[i]+L[k] L[j] L j L[i]+L[k] L[i] L i L[k] L k L[k]<L[j]+L[i] L[k] L k L[j]+L[i] L[j] L j L[i] L i cnt+=1 cnt 1 print(cnt) print cnt resolve() resolve def YesNo(Bool):
    if(Bool):
        print("Yes")
    else:
        print("No")
    return def YesNo(Bool):
    if(Bool):
        print("Yes")
    else:
        print("No")
    return YesNo def resolve():

    N=int(input())
    L=list(map(int,input().split()))

    cnt=0
    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
    print(cnt) def resolve():

    N=int(input())
    L=list(map(int,input().split()))

    cnt=0
    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
    print(cnt) resolve
import math
import collections
import itertools

def YesNo(Bool):
    if(Bool):
        print("Yes")
    else:
        print("No")
    return

def resolve():

    N=int(input())
    L=list(map(int,input().split()))

    cnt=0
    for i in range(N):
        for j in range(i+1,N):
            for k in range(j+1,N):
                if((L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k] )and (L[i]<L[j]+L[k])and (L[j]<L[i]+L[k])and (L[k]<L[j]+L[i])):
                    cnt+=1
        
    print(cnt)
resolve()
