//
// Created by yamunaku on 2020/10/23.
//

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main() {
    //CFS;
    int n;
    cin >> n;
    vl a(n);
    rep(i, n) cin >> a[i];
    map<ll, pair<ll, ll>> mp;
    rep(i, n) {
        mp[a[i]] = {1, 0};
    }
    ll ans = 0;
    while (!mp.empty()) {
        auto itr = mp.begin();
        ans += itr->second.first + itr->second.second;
        auto itr2 = mp.find(itr->first + 1);
        if (itr2 != mp.end()) {
            if((itr->second.first + itr->second.second) * itr2->second.first != 0)
            mp[itr->first + 2].second += (itr->second.first + itr->second.second) * itr2->second.first;
        }
//        cout << itr->first SP itr->second.first SP itr->second.second << endl;
        mp.erase(itr);
    }
    cout << ans << endl;
    return 0;
}