#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int A = 30;
  int n; cin >> n;
  vector<int> a(n);
  for (int& a_i : a) cin >> a_i;
  ll ans = n * (n - 1LL) / 2 + 1;
  {
    array<vector<int>, A + 1> v{};
    FOR(num, 1, A + 1) {
      v[num].assign(n + 1, 0);
      REP(i, n) v[num][i + 1] = v[num][i] + a[i] - num;
    }
    array<map<int, int>, A + 1> cnt{};
    FOR(num, 1, A + 1) {
      FOR(i, 1, n + 1) ++cnt[num][v[num][i]];
    }
    REP(i, n) {
      FOR(num, 1, A + 1) --cnt[num][v[num][i + 1]];
      ans -= cnt[a[i]][v[a[i]][i + 1]];
    }
  }
  ranges::reverse(a);
  {
    array<vector<int>, A + 1> v{};
    FOR(num, 1, A + 1) {
      v[num].assign(n + 1, 0);
      REP(i, n) v[num][i + 1] = v[num][i] + a[i] - num;
    }
    array<map<int, int>, A + 1> cnt{};
    FOR(num, 1, A + 1) {
      FOR(i, 1, n + 1) {
        if (a[i - 1] != num) ++cnt[num][v[num][i]];
      }
    }
    REP(i, n) {
      FOR(num, 1, A + 1) {
        if (a[i] != num) --cnt[num][v[num][i + 1]];
      }
      ans -= cnt[a[i]][v[a[i]][i + 1]];
    }
  }
  cout << ans << '\n';
  return 0;
}