跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2602. Almost Arithmetical Progression

  • ID: 2608
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 枚举
  • 动态规划
  • 算法思想
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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
2
3 5
Output
2
Input
4
10 20 10 30
Output
3
Note

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

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2254 题。保留原作者与原赛事署名。