#include <bits/stdc++.h>
using namespace std;

int main() {
	int arr[]= {10,5,2,7,1,9};
	int n=sizeof(arr)/sizeof(arr[0]);
	int k=15;
	int currSum=0;
	int minLength=INT_MAX;
	map<int, int> pSum;
	pSum[0] = -1;
	for(int j=0;j<n;j++){
		currSum+=arr[j];
		int toFind=currSum-k;
		if(pSum.find(toFind)!=pSum.end()){
			int index=pSum[toFind];
			minLength=min(j-index, minLength);
		}
		pSum[currSum]=j;
	}
	cout<<minLength;
	return 0;
}