#include<bits/stdc++.h>
using namespace std;

#define QwQ330AwA return 0
#define ll long long

const int N = 1e6 + 5;

int n;
int w[N];
bool vis[N];
vector <int> pos;
ll cal(int l, int r) {
	//cout << l << ' ' << r << endl;
	int mn = 1e9, suf = 0;
	for (int i = l; i <= r; i++) mn = min(mn, w[i]), suf += vis[i];
	int pre = 0;
	int ans = 1e9;
	for (int i = l; i <= r; i++) {
		if (mn == w[i]) pre++;
		if (vis[i]) suf--;
		ans = min(ans, pre + suf);
	}
	return ans;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	int mn = 1e9;
	int f = 0;
	for (int i = 1; i <= n; i++) {
		cin >> w[i];
		f = max(f, w[i] - mn);
		mn = min(mn, w[i]);
	}
	mn = 1e9;
	pos.push_back(0);
	for (int i = 1; i <= n; i++) {
		if (w[i] - mn == f) vis[i] = 1, pos.push_back(i);
		mn = min(mn, w[i]);
	}
	int m = pos.size();
	w[0] = 2e9;
	ll ans = 0;
	for (int i = 1, j = 1; i < m; i = j) {
		while (j < m && w[pos[j]] == w[pos[i]]) j++;
		//cout << i << ' ' << j << endl;
		ans += cal(pos[i - 1] + 1, pos[j - 1]);
	}
	cout << ans;
	QwQ330AwA;
}