#include <bits/stdc++.h>
 
using namespace std;
#define int long long
typedef pair<int, int> pii;
int n;
 
 
signed main() {
    cin >> n;
    vector<pii> arr(n);
    for(int i = 0; i < n; i++) {
        int value; cin >> value;
        arr[i] = {value, i};
    }
 
    sort(arr.begin(), arr.end());
    int minDistance = INT_MAX;
    int firstID, secondID;
    for(int i = 0; i < n - 1; i++) {
        int firstNum = arr[i].first, secondNum = arr[i + 1].first;
        if(secondNum - firstNum < minDistance) 
            firstID = arr[i].second, secondID = arr[i + 1].second;
    }
 
    int countSwap = 0;
    if(firstID != 0) countSwap++;
    if(secondID != n - 1) countSwap++;
 
    cout << countSwap;
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwojZGVmaW5lIGludCBsb25nIGxvbmcKdHlwZWRlZiBwYWlyPGludCwgaW50PiBwaWk7CmludCBuOwoKCnNpZ25lZCBtYWluKCkgewogICAgY2luID4+IG47CiAgICB2ZWN0b3I8cGlpPiBhcnIobik7CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaW50IHZhbHVlOyBjaW4gPj4gdmFsdWU7CiAgICAgICAgYXJyW2ldID0ge3ZhbHVlLCBpfTsKICAgIH0KCiAgICBzb3J0KGFyci5iZWdpbigpLCBhcnIuZW5kKCkpOwogICAgaW50IG1pbkRpc3RhbmNlID0gSU5UX01BWDsKICAgIGludCBmaXJzdElELCBzZWNvbmRJRDsKICAgIGZvcihpbnQgaSA9IDA7IGkgPCBuIC0gMTsgaSsrKSB7CiAgICAgICAgaW50IGZpcnN0TnVtID0gYXJyW2ldLmZpcnN0LCBzZWNvbmROdW0gPSBhcnJbaSArIDFdLmZpcnN0OwogICAgICAgIGlmKHNlY29uZE51bSAtIGZpcnN0TnVtIDwgbWluRGlzdGFuY2UpIAogICAgICAgICAgICBmaXJzdElEID0gYXJyW2ldLnNlY29uZCwgc2Vjb25kSUQgPSBhcnJbaSArIDFdLnNlY29uZDsKICAgIH0KCiAgICBpbnQgY291bnRTd2FwID0gMDsKICAgIGlmKGZpcnN0SUQgIT0gMCkgY291bnRTd2FwKys7CiAgICBpZihzZWNvbmRJRCAhPSBuIC0gMSkgY291bnRTd2FwKys7CiAgICAKICAgIGNvdXQgPDwgY291bnRTd2FwOwogICAgcmV0dXJuIDA7Cn0=

NAoyIDMgNSAxIA==

4
2 3 5 1