A Prank

JATC and his friend Giraffe are currently in their room, solving some problems. Giraffe has written on the board an array a1, a2, ..., an of integers, such that 1≤a1<a2<…<an≤103, and then went to the bathroom.

JATC decided to prank his friend by erasing some consecutive elements in the array. Since he doesn't want for the prank to go too far, he will only erase in a way, such that Giraffe can still restore the array using the information from the remaining elements. Because Giraffe has created the array, he's also aware that it's an increasing array and all the elements are integers in the range [1,103].

JATC wonders what is the greatest number of elements he can erase?

Input

The first line of the input contains a single integer n (1≤n≤100) — the number of elements in the array.

The second line of the input contains n integers ai (1≤a1<a2<⋯<an≤103) — the array written by Giraffe.

Output

Print a single integer — the maximum number of consecutive elements in the array that JATC can erase.

If it is impossible to erase even a single element, print 0.

Examples

Input

6
1 3 4 5 6 9

Output

Input

3
998 999 1000

Output

Input

5
1 2 3 4 5

Output

4

Solution

#include <bits/stdc++.h>

using namespace std;

int main() {

int n;

cin >> n;

vector<int> a(n);

for (int i = 0; i < n; i++) {

cin >> a[i];

}

vector<int> color(n);

for (int i = 0; i < n - 2; i++) {

if (a[i + 1] - a[i] == 1 and a[i + 2] - a[i + 1] == 1) {

color[i + 1] = 1;

}

color[0] = (a[1] == 2) ? 1 : 0;

color[n - 1] = (a[n - 2] == 999) ? 1 : 0;

int ans = 0, cur = 0;

for (int i = 0; i < n; i++) {

cur = color[i] == 1 ? cur + 1 : 0;

ans = max(ans, cur);

}

cout << ans << endl;

return 0;

}

Comments