#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
typedef long long ll;
//const ll N = 1e5 + 2;
////const ll OO = LONG_LONG_MAX;
////const ll mod = 1e9 + 7;
//ll ans[N];
void solve(){
int n; cin>>n;
ll a[n];
for(auto &z: a) cin>>z;
map<ll,int>m;
ll l=0,cnt=0;
ll ans=n;
while(l<n)
{
if(m[a[l]]==0)
{
++cnt;
m[a[l]]=1;
}
else
{
ans+=(((cnt-1)*cnt)/2);
cnt=1;
m.clear();
m[a[l]]=1;
}
++l;
}
if(cnt)
{
ans+=(((cnt-1)*cnt)/2);
}
cout<<ans;
}
int main(){
fast;
int t = 1;
//cin >> t;
while (t--){
solve();
cout << "\n";
}
}
// problem:
/*n=8
* 8c1; 7c2;6c3; 5c4;
* 8 7 6 5 4 3 2 1
*
*
*
*/
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgZmFzdCBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApO2Npbi50aWUoMCk7Y291dC50aWUoMCkKdHlwZWRlZiBsb25nIGxvbmcgbGw7Ci8vY29uc3QgbGwgTiA9IDFlNSArIDI7Ci8vLy9jb25zdCBsbCBPTyA9IExPTkdfTE9OR19NQVg7Ci8vLy9jb25zdCBsbCBtb2QgPSAxZTkgKyA3OwovL2xsIGFuc1tOXTsKdm9pZCBzb2x2ZSgpewogICAgaW50IG47IGNpbj4+bjsKICAgIGxsIGFbbl07CiAgICBmb3IoYXV0byAmejogYSkgY2luPj56OwogICAgbWFwPGxsLGludD5tOwogICAgbGwgbD0wLGNudD0wOwogICAgbGwgYW5zPW47CiAgICB3aGlsZShsPG4pCiAgICB7CiAgICAgICAgaWYobVthW2xdXT09MCkKICAgICAgICB7CiAgICAgICAgICAgICsrY250OwogICAgICAgICAgICBtW2FbbF1dPTE7CiAgICAgICAgfQogICAgICAgIGVsc2UKICAgICAgICB7CiAgICAgICAgICAgIGFucys9KCgoY250LTEpKmNudCkvMik7CiAgICAgICAgICAgIGNudD0xOwogICAgICAgICAgICBtLmNsZWFyKCk7CiAgICAgICAgICAgIG1bYVtsXV09MTsKICAgICAgICB9CiAgICAgICAgKytsOwogICAgfQogICAgaWYoY250KQogICAgewogICAgICAgIGFucys9KCgoY250LTEpKmNudCkvMik7CiAgICB9CiAgICBjb3V0PDxhbnM7Cn0KaW50IG1haW4oKXsKICAgIGZhc3Q7CiAgICBpbnQgdCA9IDE7CiAgICAvL2NpbiA+PiB0OwogICAgd2hpbGUgKHQtLSl7CiAgICAgICAgc29sdmUoKTsKICAgICAgICBjb3V0IDw8ICJcbiI7CiAgICB9Cn0KLy8gcHJvYmxlbToKLypuPTgKICogOGMxOyA3YzI7NmMzOyA1YzQ7CiAqIDggNyA2IDUgNCAzIDIgMQogKgogKgogKgogKi8=