CF365B The Fibonacci Segment

You have array $ a_{1},a_{2},...,a_{n} $ . Segment $ [l,r] $ ( $ 1

The first line contains a single integer $ n $ ( $ 1

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