#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, a[maxn], pre[maxn], suf[maxn], maxx, cnt;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen("tree.inp", "r"))
{
freopen("tree.inp", "r", stdin);
freopen("tree.out", "w", stdout);
}
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
pre[1] = 1;
suf[n] = 1;
for(int i = 2; i <= n; i++)
{
if(a[i] > a[i - 1]) pre[i] = pre[i - 1] + 1;
else pre[i] = 1;
maxx = max(maxx, pre[i]);
}
for(int i = n - 1; i >= 1; i--)
{
if(a[i] < a[i + 1]) suf[i] = suf[i + 1] + 1;
else suf[i] = 1;
}
for(int i = 2; i < n; i++)
{
if(a[i - 1] < a[i + 1]) maxx = max(maxx, pre[i - 1] + suf[i + 1]);
}
for(int i = 1; i <= n; i++)
{
if(pre[i] == maxx && maxx != n) cnt++;
else if(i >= 2 && i < n && a[i - 1] < a[i + 1] && pre[i - 1] + suf[i + 1] == maxx) cnt++;
}
cout << cnt;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGludCBtYXhuID0gMmU1ICsgNTsKaW50IG4sIGFbbWF4bl0sIHByZVttYXhuXSwgc3VmW21heG5dLCBtYXh4LCBjbnQ7CmludCBtYWluKCkKewoJaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbygwKTsKCWNpbi50aWUoMCk7CglpZihmb3BlbigidHJlZS5pbnAiLCAiciIpKQoJewoJCWZyZW9wZW4oInRyZWUuaW5wIiwgInIiLCBzdGRpbik7CgkJZnJlb3BlbigidHJlZS5vdXQiLCAidyIsIHN0ZG91dCk7Cgl9CgljaW4gPj4gbjsKCWZvcihpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSBjaW4gPj4gYVtpXTsKCXByZVsxXSA9IDE7CglzdWZbbl0gPSAxOwoJZm9yKGludCBpID0gMjsgaSA8PSBuOyBpKyspCgl7CgkJaWYoYVtpXSA+IGFbaSAtIDFdKSBwcmVbaV0gPSBwcmVbaSAtIDFdICsgMTsKCQllbHNlIHByZVtpXSA9IDE7CgkJbWF4eCA9IG1heChtYXh4LCBwcmVbaV0pOwoJfQoJZm9yKGludCBpID0gbiAtIDE7IGkgPj0gMTsgaS0tKQoJewoJCWlmKGFbaV0gPCBhW2kgKyAxXSkgc3VmW2ldID0gc3VmW2kgKyAxXSArIDE7CgkJZWxzZSBzdWZbaV0gPSAxOwoJfQoJZm9yKGludCBpID0gMjsgaSA8IG47IGkrKykKCXsKCQlpZihhW2kgLSAxXSA8IGFbaSArIDFdKSBtYXh4ID0gbWF4KG1heHgsIHByZVtpIC0gMV0gKyBzdWZbaSArIDFdKTsKCX0KCWZvcihpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKQoJewoJCWlmKHByZVtpXSA9PSBtYXh4ICYmIG1heHggIT0gbikgY250Kys7CgkJZWxzZSBpZihpID49IDIgJiYgaSA8IG4gJiYgYVtpIC0gMV0gPCBhW2kgKyAxXSAmJiBwcmVbaSAtIDFdICsgc3VmW2kgKyAxXSA9PSBtYXh4KSBjbnQrKzsKCX0KCWNvdXQgPDwgY250OwoJcmV0dXJuIDA7Cn0=