Codeforces 255C. Almost Arithmetical Progression

C. Almost Arithmetical Progression

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Gena loves sequences of numbers. Recently, he has discovered a new type of sequences which he called an almost arithmetical progression. A sequence is an almost arithmetical progression, if its elements can be represented as:

• a1 = p, where p is some integer;
• ai = ai - 1 + ( - 1)i + 1·q (i > 1), where q is some integer.

Right now Gena has a piece of paper with sequence b, consisting of n integers. Help Gena, find there the longest subsequence of integers that is an almost arithmetical progression.

Sequence s1,  s2,  ...,  sk is a subsequence of sequence b1,  b2,  ...,  bn, if there is such increasing sequence of indexes i1, i2, ..., ik(1  ≤  i1  <  i2  < ...   <  ik  ≤  n), that bij  =  sj. In other words, sequence s can be obtained from b by crossing out some elements.

Input

The first line contains integer n (1 ≤ n ≤ 4000). The next line contains n integers b1, b2, ..., bn (1 ≤ bi ≤ 106).

Output

Print a single integer — the length of the required longest subsequence.

Examples

input

Copy

2
3 5

output

Copy

2

input

Copy

4
10 20 10 30

output

Copy

3

Note

In the first test the sequence actually is the suitable subsequence.

In the second test the following subsequence fits: 10, 20, 10.

题意既让你找一个最长的子序列是这个子序列每隔一个数就相等。

看懂了提议之后就会比较好想了这很像区间的问题但是在这之间需要一个 记录变量把离结尾最近的然后给他加1就行了。

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=5000;
int dp[N][N],a[N];
int n,maxx=-1;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    for(int j=1;j<=n;j++)
    {
        int ansk=0;
        for(int i=0;i<j;i++)
        {
            dp[i][j]=dp[ansk][i]+1;//i是中间点ansk和j才是被隔开的点
            if(a[i]==a[j])
                ansk=i;
            maxx=max(maxx,dp[i][j]);
        }
    }
    cout<<maxx<<endl;
}