Codeforces 602B Approximating a Constant Range

output

standard output

When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging — but why not make a similar programming contest problem while we're at it?

You're given a sequence of n data points a₁, ..., a_n. There aren't any big jumps between consecutive data points — for each 1 ≤ i < n, it's guaranteed that |a_i + 1 - a_i| ≤ 1.

A range [l, r] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let M be the maximum and m the minimum value of a_i for l ≤ i ≤ r; the range [l, r] is almost constant if M - m ≤ 1.

Find the length of the longest almost constant range.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 100 000) — the number of data points.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100 000).

Output

Print a single number — the maximum length of an almost constant range of the given sequence.

Sample test(s)

Input

5
1 2 3 3 2

Output

4

Input

11
5 4 5 5 6 7 8 8 8 7 6

Output

5

Note

In the first sample, the longest almost constant range is [2, 5]; its length (the number of data points in it) is 4.

In the second sample, there are three almost constant ranges of length 4: [1, 4], [6, 9] and [7, 10]; the only almost constant range of the maximum length 5 is [6, 10].

            

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
int last[100005];
int a[100005];
int main()
{
    int n;
    cin>>n;
    int i;
    for(i=0; i<n; i++)
        cin>>a[i];
    int ans=0;
    int l=0;
    for(i=0; i<100005; i++)
        last[i]=-1;
    for(i=0; i<n; i++)
    {
        int x=-1;
        if(a[i]+2<=100000)
            x=max(x,last[a[i]+2]);
        if(a[i]-2>=0)
            x=max(x,last[a[i]-2]);
        l=max(l,x+1);
        ans=max(ans,i-l+1);
        last[a[i]]=i;
    }
    cout<<ans<<endl;
}
//求相差不超过1的最大区间长度。