#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  ll ans = ll(n + 1) * n / 2;
  for (int v = 1; v <= 30; v++) {
    static VI s;
    s.assign(n + 1, 0);
    rep(i, n) s[i+1] = s[i] + (a[i] - v);
    for (int mn = *min_element(all(s)); int& x : s) x -= mn;
    int mx = *max_element(all(s));
    static VI f0, f1;
    f0.assign(mx + 1, 0), f1.assign(mx + 1, 0);
    rep(i, n + 1) {
      if (i) {
        ans -= f1[s[i]];
        if (a[i-1] == v) ans -= f0[s[i]];
      }
      if (i < n) {
        (a[i] == v ? f1 : f0)[s[i]]++;
      }
    }
  }
  ans++;
  cout << ans << '\n';
}