import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string rstring(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T rtype(T)(){ return rstring.to!T; } alias rint = rtype!int, rlong = rtype!long, rreal = rtype!real;
T[] rtypes(T)(int n){ return n.iota.map!(i => rtype!T()).array; } alias rint = rtypes!int, rlong = rtypes!long, rreal = rtypes!real;
T[][] rtypess(T)(int n, int m){ return n.iota.map!(i => rtypes!T(m)).array; } alias rint = rtypess!int, rlong = rtypess!long, rreal = rtypess!real;

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

const int N = 1024;
void solve(){
	int n = rint;
	int[] ls = rint(n);
	
	long[N] lc;
	foreach(l; ls) lc[l] += 1;
	
	long ans;
	foreach(a; 0 .. N){
		foreach(b; a + 1 .. N){
			long m = lc[a] * lc[b];
			foreach(c; b + 1 .. N){
				if(a + b <= c) break;
				long x = m * lc[c];
				if(x > 0) log("a:", a, "b:", b, "c:", c, "x:", x);
				ans += x;
			}
		}
	}
	foreach(a; 0 .. N){
		int b = a;
		long m = lc[a] * (lc[b] - 1) / 2;
		foreach(c; b + 1 .. N){
			if(a + b <= c) break;
			long x = m * lc[c];
			if(x > 0) log("a:", a, "b:", b, "c:", c, "x:", x);
			ans += x;
		}
	}
	foreach(a; 0 .. N){
		foreach(b; a + 1 .. N){
			int c = b;
			long x = lc[a] * lc[b] * (lc[c] - 1) / 2;
			if(x > 0) log("a:", a, "b:", b, "c:", c, "x:", x);
			ans += x;
		}
	}
	foreach(a; 0 .. N){
		int b = a, c = b;
		long x = lc[a] * (lc[b] - 1) * (lc[c] - 2) / 6;
		if(x > 0) log("a:", a, "b:", b, "c:", c, "x:", x);
		ans += x;
	}
	
	ans.writeln;
	
}
