#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> a(n);
    vector<int> hash(100,0);
    for(int a_i = 0;a_i < n;a_i++){
       cin >> a[a_i];
       hash[a[a_i]]++;
    }
    int maxCount = 0;
    for(int i=0;i<99;i++)
    {
        if(hash[i]+hash[i+1]>maxCount)
            maxCount = hash[i] + hash[i+1];
    }
    cout<<maxCount<<endl;
    return 0;
}