n = int(input())
a = list(map(int, input().split()))
best = 2 if n > 1 else 1
current = 2
if n>2:
for i in range(2,n):
if a[i]==a[i-1]+a[i-2]:
current += 1
else:
best = max(best,current)
current = 2
best = max(best,current)
print(best)#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> nums;
for(int i = 0;i<n;i++){
int x;
cin >> x;
nums.push_back(x);
}
int count = 2;
int maxn = 0;
for(int i = 2;i<n;i++){
if(nums[i]==nums[i-1]+nums[i-2]){
count+=1;
}
else{
maxn = max(count,maxn);
count = 2;
}
}
maxn = max(count,maxn);
if(n==1){
maxn = 1;
}
cout << maxn << endl;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |