#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    /*to check if a number is contained within the
    v.push_back(7);
  vector  if(find(v.begin(),v.end(),7)!=v.end()){
        cout << 1 << endl;
    }
    */
    /*to sort by greater
    v.push_back(2);
    v.push_back(-1);
    v.push_back(5);
   sort(v.rbegin(),v.rend());
   cout << v[0];
   */
   /* to erase/insert
    v.erase(v.begin()+1);
    v.insert(v.begin()+2,7);
    */
    /*
    the distance bewteen tow elements in a vector
    cout << distance(v.begin(),v.begin()+2) << endl;
    */
    /* search about sub vector in a vector
    vector<int>vv;
    auto it =search(v.begin(),v.end(),vv.begin(),vv.end());
    if(it!=v.end())
        cout << "sub vector starts from index" << " " << it-v.begin() << endl;
        */
        /*
        vector must be sorted
      bool ans= binary_search(v.begin(),v.end());
      auto it=lower_bound(v.begin(),v.end(),2) /// find the first element grater than OR equal the given element
      auto it=upper_bound(v.begin(),v.end(),2) /// find the first element grater than  the given element
      resize(unique(v.begin(),v.end())-v.begin()); /// to remove the dublicates in vector and string
      set_intersection /// to find the insterction of elements of a given vector
      set_difference /// to find the elements in v1 not in v2
      set_union /// print the union
      swap_ranges /// to swap ranges in two vectors
      count(v.begin(),v.end(),6)/// print the occurences of 6
      */

      /* next permutation
      v.push_back(1);
      v.push_back(2);
      v.push_back(3);
      do{
       for(int i=0;i<3;i++)
        cout << v[i] << " " ;
       cout<< endl;
      }while(next_permutation(v.begin(),v.end())); /// applicaple also for strings
      */
      /*
      queue<int>q;
      q.push(20);
      q.push(50);
      q.push(-4);
   /// the print the elements in the queue while(!q.empty()){
        cout << q.front()<< endl;
        q.pop();
      }
      deque<int>dq;        /// better than queue in processing and pushing elements
      ///dq.push_back(4);
     /// dq.push_back(1);
      priority_queue<int>p; /// sort the elements of the queue in ascending order

      stack<int>ss;
      ss.push(10);
      ss.push(20);
      ss.push(30);
      while(!ss.empty()){
        cout << ss.top() << endl;
        ss.pop();
      }
      */
      /*
      set<int>s;
      s.insert(20);
      s.insert(10);
      if(s.count(20))
        cout << "jj";
   /// multiset and multimap >>> allow repitoin while also sorting
   */
   /* string related functions
   string s="abc def hoi";
   cout << s.substr(3) << endl; /// print from the current index to the end of the string
   cout << s.substr(4,3)<< endl; /// the last parameter in the strings function alawys accounts for length not index
   cout << (int)s.find("hendy")<< endl; /// cast to integer to print NULL
   cout << s.find("abc",5) << endl; /// serch from the 6th index
   cout << s.find_last_of("abc") << endl;
   cout << s.find_first_of("abc") << endl;
  /// s.replace(4,3,"x");
   cout <<s<< endl;
   s.erase(1,2);
   s.erase(4);
   cout <<s;
*/

/*.......................... BITMASKS ................................................

*/
      // convert a number into bits (integers)
      /*
      bitset<4 /* size*//*> x(8); ///x represents the bits of the number
      cout << x << endl;
      cout << (int) x.to_ulong() << endl; ///returns the bits of the number to the number
      /// convert a string to bitset
      */
      /*
      string s="100101";
      bitset<6>brr(s);
      cout << brr[0] << endl;
      cout << brr << endl;
      string newstring = brr.to_string();
      cout << newstring << endl;
      cout << brr.count() << endl; /// count the number of ones
      */
      /*
      string x="0101",y="1010";
      bitset<4>a(x);
      bitset<4>b(y);
      cout << (a&b)<< endl;
      //cout << (a<<1) << endl;
      //cout << (b>>1) << endl;
       cout << a << endl;
      cout << (~a[0]) << endl; /// flip the ith bit
*/
/*
/// generate all the subsets of the array
   char a[]={'a','b','c'};
   int n;
   cin>>n;
   int tot= (1<<n);
   for(int mask=0;mask<tot;mask++){
      for(int i=0;i<n;i++){
        if((mask&(1<<i)))
            cout << a[i];
      }
      cout << endl;
   }
   */
    /// print the sum of all subsets
    /* WHY WRONG
    long long x;
    cin>>x;
   long long mn=10e18+2;
    for(int i=0;i<=32;i++){
            if(x-(long long)pow(2,i)>=0)
              mn=(x-(long long)pow(2,i));

    }
   cout << mn+1 << endl;
   */
   /*
    ll n,l,r,x,cnt=0;
   cin>>n>>l>>r>>x;
   long long a[n];
   for(int i=0;i<n;i++)
    cin>>a[i];
   long long tot=1<<n;

   for(int mask=0;mask<tot;mask++){
        long long mn=10e18+2,mx=0,sum=0;
      for(int i=0;i<n;i++){
        long long f= (1<<i);
     /* must ustnd THIS*/
     /*  if((mask&f)){
            sum+=a[i];
            mn=min(mn,a[i]);
            mx=max(mx,a[i]);
        }
      }
      if(sum>=l&&sum<=r && mx-mn>=x)
        cnt++;
   }
     cout << cnt << endl;
     */
    int n;
    cin>>n;
    ll a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    ll ans =0;
    sort(a,a+n);
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            for(int k=j+1;k<n;k++){
                if(a[i]+a[j]>a[k]&&a[i]!=a[j]&&a[j]!=a[k])
                        ans++;
            }
        }
    }
   cout << ans << endl;






    return 0;

}


Measured memory_bytes: 3656