#include<bits/stdc++.h> using namespace std; #include<atcoder/all> using namespace atcoder; using mint=atcoder::modint998244353; #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define int long long using ld=long double; signed main(){ int N;cin>>N; vector<int> A(N);for(auto&&e:A)cin>>e; int cnt=N*(N+1)/2; int ans=1; for(int avg=1;avg<=30;avg++){ vector<int> B(N); for(int i=0;i<N;i++){ B[i]=A[i]-avg; } vector<int> sm={0}; for(auto&&e:B)sm.push_back(sm.back()+e); map<int,vector<int>> v; for(int i=0;i<sm.size();i++){ v[sm[i]].push_back(i); } dsu ds(N); for(int i=0;i<N-1;i++){ if(A[i]==avg&&A[i+1]==avg){ ds.merge(i,i+1); } } for(auto&&[val,vec]:v){ int sz=vec.size(); cnt-=sz*(sz-1)/2; set<int> ls; for(int i=0;i<sz;i++){ if(i){ if(ls.count(ds.leader(vec[i]-1)))continue; ans+=ls.size(); } if(i<sz-1){ ls.insert(ds.leader(vec[i])); } } } } ans+=cnt; cout<<ans<<endl; }