const int N = 1e6 + 100;
ll cnt;
ll mi = INT;
ll sum;
ll s[N],ans[N];
int main()
{
	int n; cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> s[i];
		if (s[i] > s[i - 1])ans[i]=ans[i-1]+1;
		else if (s[i] == s[i - 1])ans[i] = ans[i - 1];
		else
		{
			ans[i] = ans[i - 1] - 1;
			mi = min(mi,ans[i]);
		}
	}
	mi--;
	for (int i = 1; i <= n; i++)
		sum += ans[i] - mi + 1;
	cout << sum;
	return 0;
}