#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;
  int max = 0;
  int cnt = 0;
  cin >> n;
  vector<int> height(n);
  for(int height_i = 0;height_i < n;height_i++){
    cin >> height[height_i];
    if (height[height_i] > max) {
      max = height[height_i];
      cnt = 1;
    }
    else if (height[height_i] == max) {
      cnt++;
    }
  }
  cout << cnt;
  return 0;
}