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

#F2258. The Fibonacci Segment

  • ID: 2264
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 模拟
  • 编程与模拟
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

The Fibonacci Segment

题目描述

B. The Fibonacci Segment
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You have array a1,a2,...,an. Segment [l,r] (1≤l≤r≤n) is good if ai=ai-1+ai-2, for all i (l+2≤i≤r).

Let's define len([l,r])=r-l+1, len([l,r]) is the length of the segment [l,r]. Segment [l1,r1], is longer than segment [l2,r2], if len([l1,r1])>len([l2,r2]).

Your task is to find a good segment of the maximum length in array a. Note that a segment of length 1 or 2 is always good.

Input

The first line contains a single integer n (1≤n≤105) − the number of elements in the array. The second line contains integers: a1,a2,...,an (0≤ai≤109).

Output

Print the length of the longest good segment in array a.

Examples
Input
10
1 2 3 5 8 13 21 34 55 89
Output
10
Input
5
1 1 1 1 1
Output
2

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