#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 h_max = 0;
  int n_max = 0;
  int n;
  cin >> n;
  vector<int> height(n);
  for(int height_i = 0;height_i < n;height_i++){
    cin >> height[height_i];
    if (h_max < height[height_i]) {
      h_max = height[height_i];
      n_max = 1;
    } else if (h_max == height[height_i]) {
      n_max++;
    }
  }
  
  printf("%d\n", n_max);
  
  return 0;
}