void main() {
  problem();
}

void problem() {
  auto N = scan!int;
  auto L = scan!long(N);

  long solve() {
    long ans;
    foreach(x; 0..N-2) {
      auto lx = L[x];
      foreach(y; x+1..N-1) {
        auto ly = L[y];
        if (lx == ly) continue;
        foreach(z; y+1..N) {
          auto lz = L[z];
          if (lx == lz || ly == lz) continue;
          if (lx+ly > lz && ly+lz > lx && lz+lx > ly) {
            [lx,ly,lz].deb;
            ans++;
          }
        }
      }
    }

    return ans;
  }

  solve().writeln;
}

// ----------------------------------------------

import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons, std.numeric;
T[][] combinations(T)(T[] s, in int m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }
string scan(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T scan(T)(){ return scan.to!T; }
T[] scan(T)(int n){ return n.iota.map!(i => scan!T()).array; }
void deb(T ...)(T t){ debug writeln(t); }
alias Point = Tuple!(long, "x", long, "y");

// -----------------------------------------------
