#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll INF=1e9+7;
const ll inf=INF*INF;
const ll MOD=1e9+7;
const ll mod=MOD;
const int MAX=1000010;
const double PI=acos(-1.0);


signed main(){
    ll n;cin>>n;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    sort(rall(a));
    priority_queue<ll>pq;
    rep(i,n){
        if(pq.empty())pq.push(a[i]);
        else{
            if(pq.top()>a[i]+1){
                pq.pop();
                pq.push(a[i]);
            }else{
                pq.push(a[i]);
            }
        }
    }
    cout<<pq.size()<<endl;
}