#include <bits/stdc++.h>
using namespace std;
int main() {
	int n = 5;
	vector<int> v = {1,9,2,3,5};
	int k = 10;
	int cursum=0, res=0,i=0,j=0;
	while(j<n) {
		cursum+=v[j];
		if(cursum==k){ res=max(res,j-i+1); }
		while(i<=j && cursum > k) {
			cursum-=v[i];
			i++;
		}
		j++;
	}
	cout<<res<<" ";
	return 0;
}