#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;
typedef tree<
pair<int, int>,
null_type,
less<pair<int, int>>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n;
cin>>n;
int a[n+3];
set<int> s;
for(int i=1;i<=n;i++){
cin>>a[i];
s.insert(a[i]);
}
int ans = 0;
for(auto it: s){
int p[n+3];
for(int i=1;i<=n;i++){
if(a[i] == it) p[i] = 1;
else p[i] = -1;
}
int pref[n+3];
pref[0] = 0;
for(int i=1;i<=n;i++){
pref[i] = pref[i-1] + p[i];
}
map<int, int> freq;
ordered_set so;
freq[pref[n]]++;
so.insert({pref[n], n});
for(int i=n;i>=1;i--){
ans += (n-i+1)-freq[pref[i-1]]-so.order_of_key({pref[i-1], i-1});
freq[pref[i-1]]++;
so.insert({pref[i-1], i-1});
}
}
cout<<ans<<endl;
return 0;
}
