import std.stdio, std.conv, std.math, std.string, std.range, std.array,
       std.algorithm;

immutable MOD = 10^^9 + 7;
// コンパイル時定数よい

ulong combination(int n, int r){
	if (r == 0) return 1;
	if (r > n/2) return combination(n,n-r);
	ulong ret=1;
	for (int i = 1; i <= r; ++i)
		ret = (ret*(n-i+1)/i) % MOD;
	return ret;
}

void main(){
  readln();
  auto A = readln().strip().split().map!(to!int)().array();

  A.sort();

  long mul = 1;
  int spnum = 1;

  int k;
  while(k < A.length-1) {
    int tmul = 1;
    while(k < A.length-1 && A[k] == A[k+1]) {
      ++ tmul;
      ++ k;
    }
    mul *= tmul%MOD;
    ++ spnum;
    ++ k;
  }

  writeln((spnum.combination(3) * mul) % MOD);
}