#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
  ll N,A;
  cin>>N;
  map<ll,ll> m;
  for(ll i=0; i<N; ++i){
    cin>>A;
    if(m.count(A)>0){
      m[A]+=1;
    } else {
      m.insert(make_pair(A,1));
    }
  }
  ll a=m.size();
  ll b=1;
  for(ll i=a; i>a-3; --i){
    b%=mod;
    ll i2=i;
    i2%=mod;
    b*=i;
  }
  b%=mod;
  ll c=6;
  ll d=b/c;
  for(auto i=m.begin(); i!=m.end(); ++i){
    d%=mod;
    ll e=i->second;
    d*=e;
  }
  d%=mod;
  cout<<d<<endl;
  return 0;
}