#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#include <functional>
#include <ctime>
#include <bitset>
#pragma warning(disable:4996) 

//#define ATCODER
#ifdef ATCODER
#include <atcoder/all>
#endif

typedef long long ll;
typedef unsigned long long ull;
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define LINF3 1000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
const long long MOD = 998244353;

using namespace std;
#ifdef ATCODER
using namespace atcoder;
#endif

void solve()
{
    int n;
    scanf("%d", &n);
    vector<int> a(n);
    vector<pair<int, int>> z;
    int x = 0, y = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &a[i]);
        if (i > 0) {
            if (a[i] > a[i - 1]) {
                y++;
            }
            else {
                x++;
            }
            z.push_back(make_pair(x, y));
        }
    }
    int x1 = z.back().first;
    int y1 = z.back().second;

    vector<pair<int, int>> z0;
    x = 0; y = 0;
    for (int i = 0; i <x1; i++) {
        x++;
        z0.push_back(make_pair(x, y));
    }
    for (int i = 0; i < y1; i++) {
        y++;
        z0.push_back(make_pair(x, y));
    }
    ll ans = 0;
    for (int i = 0; i < x1 + y1; i++) {
        ans+=abs(z[i].first - z0[i].first) + abs(z[i].second - z0[i].second);
    }
    printf("%lld\n", ans / 2);
    return;
}

int main()
{
#if 1
    solve();
#else
    int T, t;
    scanf("%d", &T);
    for (t = 0; t < T; t++) {
        //printf("Case #%d: ", t + 1);
        solve();
    }
#endif
    return 0;
}