|Manthan, Codefest 16|
Yash has recently learnt about the Fibonacci sequence and is very excited about it. He calls a sequence Fibonacci-ish if
You are given some sequence of integers a 1, a 2, ..., a n. Your task is rearrange elements of this sequence in such a way that its longest possible prefix is Fibonacci-ish sequence.
The first line of the input contains a single integer n (2 ≤ n ≤ 1000) — the length of the sequence a i.
The second line contains n integers a 1, a 2, ..., a n (|a i| ≤ 109).
Print the length of the longest possible Fibonacci-ish prefix of the given sequence after rearrangement.
1 2 -1
28 35 7 14 21
In the first sample, if we rearrange elements of the sequence as - 1, 2, 1, the whole sequence a i would be Fibonacci-ish.
In the second sample, the optimal way to rearrange elements is , , , , 28.