#include<bits/stdc++.h>
#define ll long long
#define fast  ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define f1(a,b) for(ll i=a; i<b; i++)
using namespace std;

int main()
{
    fast
    ll n,k=1;
    cin>>n;
    ll a[n];

    f1(0,n)
    {
        cin>>a[i];

    }
    sort(a,a+n);
    ll b[3]={a[0]};
    b[0]=a[0];
    b[1]=a[1];
    b[2]=a[2];



    ll ans=1;
    ll ca=count(a,a+n,b[0]);
    ll cb=count(a,a+n,b[1]);
    ll cc=count(a,a+n,b[2]);

    if(b[2]!=b[1]&&b[1]!=b[0])
    {
        ans=ca*cb*cc;

    }
    else if(b[2]==b[1]&&b[1]!=b[0])
    {
        ans=ca*(cb*(cb-1)/2);
    }
    else if(b[0]==b[1]&&b[1]!=b[2])
    {
        ans=(ca*(ca-1))/2*cc;
    }
    else if(b[0]==b[1]&&b[1]==b[2])
    {
        ans=(ca*(ca-1)*(ca-2))/6;
    }







    cout<<ans;

}