#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
int main() {
  fastio();
  int tc = 1;
  while (tc--) {
    int n;
    cin >> n;
    long long int a[n];
    for (int i = 0; i < (n); i++) cin >> a[i];
    long long int ans = 0;
    for (int i = 0; i < (n); i++) {
      int j = i + 1;
      while (j < n && a[j] == a[i]) {
        j++;
      }
      long long int cnt = j - i;
      ans += (cnt) * (cnt + 1) / 2;
      i = j - 1;
    }
    cout << ans;
  done:;
  }
  return 0;
}
