#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> height(n);
    
    for(int height_i = 0;height_i < n;height_i++){
       cin >> height[height_i];
    }
    
    auto max_elements = std::max_element(std::begin(height), std::end(height));
    
    int count = 0;
    for(; max_elements != height.end(); max_elements++) {
        count++;
        *max_elements++; 
    }
    
    cout << count;
    
    return 0;
}