#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
map<int,int> S;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	ll ret=1LL*N*(N-1)/2;
	FOR(i,N) {
		cin>>x;
		ret-=S[x];
		S[x]++;
	}
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

#include <iostream>
#include <vector>
#include <map>
#include <numeric>
#include <algorithm>

using namespace std;
typedef long long ll;

int main() {
    ll n;
    cin >> n;
    map<ll, ll> m;
    vector<ll> v;
    {
        ll tmp;
        while (cin >> tmp) {
            m[tmp]++;
            v.push_back(tmp);
        }
    }
    ll ans = 0;
    for (ll i: v) {
        ans += (n - m[i]);
    }
    cout << ans / 2LL << endl;
}