#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;

unsigned int height[10000001];

int main(){
    int n;
    cin >> n;
    unsigned int ht;
    //vector<int> height(n);
    for(int height_i = 0;height_i < n;height_i++){
       cin >> ht;        
           height[ht]++;
    }
    
  //  unsigned int cnt = 0;
    unsigned int max = 0;
	for (int candle = 0; candle < n; ){
		while (height[candle++] == 0);

		if (max<height[candle - 1])
			max = height[candle - 1];
	}

    
    cout<<max<<endl;     
    
    
    return 0;
}