#include using namespace std; #define REP(i, n) for (int i=0; i<(n); ++i) #define FOR(i, a, n) for (int i=(a); i<(n); ++i) #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(),(x).end() #define DUMP(x) cerr<<#x<<" = "<<(x)< ostream &operator<<(ostream &os, const vector &v) { os << "["; REP(i, SZ(v)) { if (i) os << ", "; os << v[i]; } return os << "]"; } template ostream &operator<<(ostream &os, const pair &p) { return os << "(" << p.first << " " << p.second << ")"; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using vi = vector; using vll = vector; using vvi = vector; using vvll = vector; const ll MOD = 1e9 + 7; const int INF = INT_MAX / 2; const ll LINF = LLONG_MAX / 2; const ld eps = 1e-9; int main() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(10); int n; cin >> n; map mp; REP(i, n) { int a; cin >> a; mp[a]++; } vector

v; for(auto &e: mp) { v.emplace_back(e); } int ma = 1; REP(i, SZ(v)) { chmax(ma, v[i].second); } REP(i, SZ(v)-1) { if(v[i].first == v[i+1].first - 1) { chmax(ma, v[i].second + v[i+1].second); } } cout << ma << endl; return 0; }