MEDIAN

#define task "MEDIAN"
#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

using ll = long long;
using ld = long double;

constexpr int N = 1e6 + 5;

int n, a[N], b[N], m, c[N], id[N];
ll g[N];

void Read()
{
    cin >> n;

    for (int i = 1; i <= n; ++i)
        cin >> a[i];
}

int Median(int n, int a[N])
{
    for (int i = 1; i <= n; ++i)
        c[i] = a[i];

    sort(c + 1, c + n + 1);

    return c[(n + 1) / 2];
}

void Sub_1()
{
    int ans = 0, v = Median(n, a);

    for (int i = 1; i <= n; ++i)
        for (int j = i; j <= n; ++j)
        {
            m = 0;

            for (int t = i; t <= j; ++t)
                b[++m] = a[t];

            if (Median(m, b) == v)
                ++ans;
        }

    cout << ans;
}

struct FenwickTree
{
    int n, a[N];

    FenwickTree()
    {
        fill_n(a, N, 0);
    }

    void Update(int p, int v)
    {
        for (; p <= n; p += p & -p)
            a[p] += v;
    }

    int Get(int p)
    {
        int ans(0);
        for (; p; p -= p & -p)
            ans += a[p];
        return ans;
    }
} h;

ll f(int v)
{
    g[id[0] = 0] = 0;
    for (int i = 1; i <= n; ++i)
        g[id[i] = i] = g[i - 1] - 1 + 2 * (a[i] >= v);

    sort(id, id + n + 1, [&](const int &x, const int &y)
         { return g[x] < g[y] || (g[x] == g[y] && x > y); });

    h.n = n + 1;

    ll ans(0);

    for (int i = 0; i <= n; ++i)
    {
        ans += h.Get(id[i] + 1);
        h.Update(id[i] + 1, 1);
    }
    for (int i = 0; i <= n; ++i)
        h.Update(id[i] + 1, -1);

    return ans;
}

void Sub_3()
{
    int v = Median(n, a);

    cout << f(v) - f(v + 1) << "\n";
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if (fopen(task ".INP", "r"))
    {
        freopen(task ".INP", "r", stdin);
        freopen(task ".OUT", "w", stdout);
    }

    Read();

    if (n <= 100)
        Sub_1();
    else
        Sub_3();
}