#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; i++) cin >> A[i];
	sort(A.begin(), A.end());

	for (int i = 0; i < N - 1; i++) {
		if (A[i] + 1 == A[i + 1]) {
			cout << 2 << '\n';
			return 0;
		}
	}
	cout << 1 << '\n';
}