#include<iostream>
#include<unordered_set>
#include<vector>
using namespace std;
int main() {
unordered_set<int> cnt;
int n;
cin >> n;
vector<int> x(n);
for(int i = 0; i < n; i++) {
cin >> x[i];
}
long long ans = 0;
int l = 0;
for(int r = 0; r < n; r++) {
while(cnt.count(x[r])) {
cnt.erase(x[l++]);
}
cnt.insert(x[r]);
ans += r - l + 1;
}
cout << ans << '\n';
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHVub3JkZXJlZF9zZXQ+CiNpbmNsdWRlPHZlY3Rvcj4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXVub3JkZXJlZF9zZXQ8aW50PiBjbnQ7CglpbnQgbjsKCWNpbiA+PiBuOwoJdmVjdG9yPGludD4geChuKTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKCQljaW4gPj4geFtpXTsKCX0KCWxvbmcgbG9uZyBhbnMgPSAwOwoJaW50IGwgPSAwOwoJZm9yKGludCByID0gMDsgciA8IG47IHIrKykgewoJCXdoaWxlKGNudC5jb3VudCh4W3JdKSkgewoJCQljbnQuZXJhc2UoeFtsKytdKTsKCQl9CgkJY250Lmluc2VydCh4W3JdKTsKCQlhbnMgKz0gciAtIGwgKyAxOwoJfQoJY291dCA8PCBhbnMgPDwgJ1xuJzsKCXJldHVybiAwOwp9Cg==