Problem:
 Score : 200 points    Problem Statement We have sticks numbered 1, \cdots, N . The length of Stick i  (1 \leq i \leq N) is L_i .  In how many ways can we choose three of the sticks with different lengths that can form a triangle?  That is, find the number of triples of integers (i, j, k)  (1 \leq i < j < k \leq N) that satisfy both of the following conditions:   L_i , L_j , and L_k are all different.  There exists a triangle whose sides have lengths L_i , L_j , and L_k .       Constraints  1 \leq N \leq 100  1 \leq L_i \leq 10^9  All values in input are integers.         Input Input is given from Standard Input in the following format:  N  L_1  L_2  \cdots  L_N       Output Print the number of ways to choose three of the sticks with different lengths that can form a triangle.        Sample Input 1 5
4 4 9 7 5      Sample Output 1 5  The following five triples (i, j, k) satisfy the conditions: (1, 3, 4) , (1, 4, 5) , (2, 3, 4) , (2, 4, 5) , and (3, 4, 5) .       Sample Input 2 6
4 5 4 3 3 5      Sample Output 2 8  We have two sticks for each of the lengths 3 , 4 , and 5 . To satisfy the first condition, we have to choose one from each length.  There is a triangle whose sides have lengths 3 , 4 , and 5 , so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.       Sample Input 3 10
9 4 6 1 9 6 10 6 6 8      Sample Output 3 39       Sample Input 4 2
1 1      Sample Output 4 0  No triple (i, j, k) satisfies 1 \leq i < j < k \leq N , so we should print 0 .

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    N = r_int()
    L = R()
    L.sort()
    cnt = 0
    for a, b, c in combinations(L, 3):
        if a != b and a != b and b != c and a + b > c:
            cnt += 1
    print(cnt)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    


    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
import itertools
N=int(input())
L=list(map(int,input().split()))

ans=0
for lines in itertools.combinations(L, 3):
  if lines[0]!=lines[1] and lines[0]!=lines[2] and lines[1]!=lines[2]:
    lines=sorted(list(lines))
    if lines[0]+lines[1]<=lines[2]:
      continue
    ans+=1
print(ans)

Solution (Python):
N = int(input())

L = list (map(int, input().split()))
count = 0
for i in range(N):
    for j in range(i,N):
        for k in range(j,N):
            if L[i]<L[j]+L[k] and L[j]<L[i]+L[k] and L[k]<L[j]+L[i] and L[i]!=L[j]and L[j]!=L[k] and L[k]!=L[i]:
                count +=1
print(count)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
ans=0
for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if max(l[i],l[j],l[k])<l[i]+l[j]+l[k]-max(l[i],l[j],l[k]):
                if l[i]!=l[j] and l[k]!=l[i] and l[j]!=l[k]:
                    ans+=1
print(ans)

Solution (Python):
n = int(input())
l = list(map(int,input().split()))

c = 0
f = 0
s = 0
t = 0

for i in range(n):
    for j in range(i, n):
        for k in range(j,n):
            if l[i] != l[j] and l[j] != l[k] and l[k] != l[i] and l[i] < l[j] +l[k] and l[j] < l[i]+l[k] and l[k] < l[i]+l[j]:
                c+=1

print(c)

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
n = int(input())


l = list(map(int, sys.stdin.readline().split()))


ans = 0
for i in range(n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            if l[i] >= l[j] + l[k]:
                continue
            if l[j] >= l[i] + l[k]:
                continue
            if l[k] >= l[j] + l[i]:
                continue

            if l[i] == l[j]:
                continue
            if l[k] == l[j]:
                continue
            if l[i] == l[k]:
                continue
            

            ans += 1
            

print(ans)

Solution (Python):
n = int(input())
L = list(map(int, input().split()))
result = 0
for i in range(n):
    for j in range(i + 1, n):
        for k in range(j + 1, n):
            a = L[i]
            b = L[j]
            c = L[k]
            if a == b or b == c or c == a:
                continue
            if a+b > c and b+c > a and c+a > b:
                result += 1
                

print(result)

Solution (Python):
n = int(input())
L = list(map(int, input().split()))
L = sorted(L)
ans = 0

for i in range(n):
    for j in range(i,n):
        for k in range(j,n):
            if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
                if L[k] < L[i] + L[j]:
                    ans += 1

print(ans)

Solution (Python):
n = int(input())
l = list(map(int,input().split()))

ans = 0
for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if l[i]==l[j] or l[j]==l[k] or l[k]==l[i]:
                continue
            else:
                t=[l[i],l[j],l[k]]
                t.sort()
                if t[0]+t[1]>t[2]:
                    ans+=1
print(ans)

Solution (Python):
import math


def main():
    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] or L[j] == L[k] or L[k] == L[i]:
                    continue
                sum_ = L[i] + L[j] + L[k]
                max_ = max(L[i], L[j], L[k])

                if max_ < sum_ - max_:
                    cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):
_ = input()
L = [int(i) for i in input().split()]

if len(L) < 3:
  print(0)
  exit()

cnt = 0

for i in range(len(L) - 2):
  for j in range(i + 1, len(L) - 1):
    if i == j:
      continue
    for k in range(j + 1, len(L)):
      if k == i or k == j:
        continue
      if L[i] == L[j] or L[j] == L[k] or L[k] == L[i]:
        continue
      if (L[i] + L[j] > L[k] and 
          L[j] + L[k] > L[i] and
          L[k] + L[i] > L[j]):
        cnt += 1

print(cnt)

Solution (Python):

import itertools
N = int(input())
Ls = map(int, input().split())
res = 0
for data in itertools.combinations(Ls, 3):
    data = list(data)
    if len(set(data))==3:
        max_num = data.pop(data.index(max(data)))
        if max_num < sum(data):
            res += 1
print(res)

Solution (Python):








    






mod = int(1e9+7)

INF = 1<<50

def readInt():
    return list(map(int,input().split()))

def main():
    n = int(input())
    l = readInt()
    l.sort()
    ans = 0
    for i in range(n-2):
        for j in range(i+1,n-1):
            if l[i]==l[j]:
                continue
            for k in range(j+1,n):
                if l[i]==l[k] or l[j]==l[k]:
                    continue
                if l[k]<l[i]+l[j]:
                    ans += 1
    print(ans)
    return

if __name__=='__main__':
    main()

Solution (Python):
import itertools


n = int(input())
a = list(map(int, input().split()))

a.sort()
cnt = 0
for v in itertools.combinations(a, 3):
    x, y, z = v[0], v[1], v[2]
    if x + y > z and x != y and y != z and z != x:
        cnt += 1

print(cnt)

Solution (Python):
n=int(input())
L=list(map(int,input().split()))
L=sorted(L)
s=0
for i in range(n-2):
    for j in range(i+1,n-1):
        if L[i]!=L[j]:
            for k in range(j+1,n):
                if L[j]!=L[k] and L[i]+L[j]>L[k]:
                    s+=1
                elif L[i]+L[j]<=L[k]:
                    break
print(s)

Solution (Python):
n=int(input())
L=list(map(int,input().split()))
c=0
for i in range(n-2):
    for j in range(i,n-1):
        for k in range(j,n):
            if L[i]!=L[j] and L[i]!=L[k] and L[j]!=L[k]:
                LS=sorted([L[i],L[j],L[k]])
                if LS[2]<LS[1]+LS[0]:
                    c+=1
print(c)

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

L.sort()
cnt = 0
for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            if L[i] < L[j] and L[j] < L[k] and L[i] + L[j] > L[k]:
                cnt += 1

print(cnt)

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
ans = 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]>L[k] and L[j]+L[k]>L[i] and L[k]+L[i]>L[j]:
                if L[i] != L[j] and L[j] != L[k] and L[k] != L[i]:
                    ans += 1
print(ans)

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
ans = 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]:
                if l[i] + l[j] > l[k] and l[i] + l[k] > l[j] and l[k] + l[j] > l[i]:
                    ans += 1
print(ans)

Solution (Python):

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

ans=0
for i in range(N-2):
    for j in range(i+1,N-1):
        if L[j]>L[i]:
            for k in range(j+1,N):
                if L[k]>L[j]:
                    if L[i]+L[j]>L[k]:
                        ans +=1
print(ans)

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
l.sort()
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[j] != l[k] and l[k] != l[i] and l[i] + l[j] > l[k]:
                cnt += 1
print(cnt)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))

ans=0

for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            if l[i]!=l[j] and l[j]!=l[k] and l[k]!=l[i]:
                if l[i]+l[j]>l[k] and l[j]+l[k]>l[i] and l[k]+l[i]>l[j]:
                    ans+=1

print(ans)

Solution (Python):
def resolve():
    N = int(input())
    L = list(map(int, input().split()))
    cnt = 0
    import itertools
    for x, y, z in itertools.combinations(L, 3):
        if x != y and y != z and z != x:
            M = max(x, y, z)
            if M < sum([x, y, z]) - M:
                cnt += 1
    print(cnt) 

    
if '__main__' == __name__:
    resolve()

Solution (Python):
N = int(input())
l = [int(x) for x in input().split()]
l.sort(reverse = True)
ans = 0
for i in range(N-2):
    for j in range(i+1,N-1):
        for k in range(j+1,N):
            if l[i] == l[j] or l[j] == l[k]:
                continue
            if l[i] >= l[j]+l[k]:
                continue
            ans += 1
print(ans)

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
ans = 0
if n == 1:
  print(0)
  exit()
if n == 2:
  print(0)
  exit()
for i in range(n-2):
  for j in range(i+1, n-1):
    for k in range(j+1, n):
      if l[i] == l[j]:
        continue
      if l[i] == l[k]:
        continue
      if l[j] == l[k]:
        continue
      if l[i] >= l[j] + l[k]:
        continue
      if l[j] >= l[i] + l[k]:
        continue
      if l[k] >= l[i] + l[j]:
        continue
      ans += 1
print(ans)

Solution (Python):
n = int(input())
L = list(map(int, input().split()))
from itertools import combinations
ns=[i for i in range(n)]
ans=0
for i in combinations(ns,3):
    if L[i[0]]!=L[i[1]] and L[i[0]]!=L[i[2]] and L[i[1]]!=L[i[2]]:
        new=[L[i[0]],L[i[1]],L[i[2]]]
        new=sorted(new)
        if new[0]+new[1]>new[2]:
            ans+=1
        
print(ans)

Solution (Python):
def main():
    n = int(input())
    l = [int(v) for v in input().split()]
    ans = 0
    for i in range(n-2):
        for j in range(i+1, n-1):
            for k in range(j+1, n):
                l3 = sorted([l[i],l[j],l[k]])
                if l3[0]!=l3[1] and l3[1]!=l3[2] and l3[0]+l3[1]>l3[2]:
                    ans += 1
    print(ans)

main()

Solution (Python):
import sys
import heapq, functools, collections
import math, random
from collections import Counter, defaultdict






def solve(lst):  
    console("----- solving ------")

    res = 0

    lst = sorted(lst)
    for i,x in enumerate(lst):
        for j,y in enumerate(lst[i+1:], start=i+1):
            for _,z in enumerate(lst[j+1:], start=j+1):
                if x == y or y == z or x == z:
                    continue
                if x+y > z:
                    res += 1

    
    return res


def console(*args):  
    print('\033[36m', *args, '\033[0m', file=sys.stderr)
    return




for case_num in [1]:
    
    

    
    k = int(input())
    
    
    

    
    lst = list(map(int,input().split()))

    
    
    
    
    
    

    res = solve(lst)  
    
    
    

    
    print(res)

Solution (Python):
n = int(input())
l = list(map(int, input().split()))
l.sort()


ans = 0
for i in range(n-2):
    for j in range(i+1,n-1):
        for k in range(j+1,n):
            
            if (l[i]+l[j] > l[k]):
                if (l[i]!=l[j] and l[j]!=l[k] and l[k]!=l[i]):
                    ans += 1
print(ans)

Solution (Python):
n = int(input())
L = list(map(int,input().split()))
L.sort()
ans = 0
n = len(L)
for i in range(n):
    for j in range(i+1,n):
        for k in range(j+1,n):
            if L[i] + L[j] > L[k] and L[i] < L[j] < L[k]:
                ans += 1
print(ans)

Solution (Python):
n = int(input())
L = tuple(map(int, input().split()))
from collections import Counter
LC = Counter(L)
L = sorted(list(set(L)))
n = len(L)

ans = 0
for i in range(n-2):
    ci = LC[L[i]]
    for j in range(i+1, n):
        cj = LC[L[j]]
        for k in range(j+1, n):
            ck = LC[L[k]]
            if L[k] < L[i] + L[j]:
                ans += ci*cj*ck
print(ans)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
ans=0
for i in range(n):
    for j in range(n):
        for k in range(n):
            if i<j and j<k:
                le=[l[i],l[j],l[k]]
                le.sort()
                if le[0]+le[1]>le[2] and le[0]!=le[1] and le[1]!=le[2] and le[2]!=le[0]:

                    ans+=1
print(ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
a.sort()

ans = 0
for i in range(n):
    for j in range(i + 1, n):
        for k in range(j + 1, n):
            if a[i] < a[j] < a[k] and a[k] < a[i] + a[j]:
                ans += 1

print(ans)

Solution (Python):
from collections import Counter
from itertools import combinations
def main():
    n = int(input())
    L = list(map(int, input().split()))
    c = Counter(L)
    ans = 0
    for e in combinations(c.keys(), 3):
        i, j, k = sorted(list(e))
        if k < i + j:
            ans += c[i] * c[j] * c[k]
    print(ans)




if __name__ == '__main__':
    main()

Solution (Python):
import itertools
import sys

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

if N<3:
  print(0)
  sys.exit()

ans=0

for i in itertools.combinations(L,3):
  t=list(i)
  t.sort()
  x,y,z=t

  if len(set(i))!=3:
    continue
  
  if x+y>z:
    ans+=1
print(ans)

Solution (Python):
import sys
input = sys.stdin.buffer.readline
N = int(input())
L = list(map(int, input().split()))

ans = 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]:
                continue
            if L[j] == L[k]:
                continue
            if L[k] == L[i]:
                continue
            if L[i] + L[j] <= L[k]:
                continue
            if L[j] + L[k] <= L[i]:
                continue
            if L[k] + L[i] <= L[j]:
                continue
            ans += 1
print(ans)

Solution (Python):
n = int(input())
ans = 0
lis = list(map(int,input().split()))
for i in range(n):
  for j in range(i,n):
    for k in range(j,n):
      if i != j and j != k and i != k:
        if lis[i] != lis[j] and lis[j] != lis[k] and lis[i] != lis[k]:
          if max(lis[i],lis[j],lis[k]) < lis[i]+lis[j]+lis[k]-max(lis[i],lis[j],lis[k]):
            ans += 1
print(ans)

Solution (Python):
def main():
    n = int(input())
    inlis = list(map(int, input().split()))
    inlis.sort()
    ans = 0
    
    for i in range(n):
        for j in range(i+1, n):
            for k in range(j+1, n):
                if inlis[i] + inlis[j] > inlis[k] and inlis[k] - inlis[j] < inlis[i] and inlis[i] != inlis[j] and inlis[j] != inlis[k] and inlis[k] != inlis[i]:
                    ans += 1
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
from itertools import combinations

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

ans = 0
for x,y,z in combinations(L, 3):
    x,y,z = sorted((x,y,z))
    if x < y < z and x + y > z:
        ans += 1

print(ans)