#include <iostream>
using namespace std;
#include <bits/stdc++.h>
#include<vector>
int main() {
	// your code goes here
	vector<int>arr={5,6,7,8,10,4,3,2,1};
	int k=8;
	int n=arr.size();
	int count=0;
	int smallest_length=INT_MAX;
	for(int i=0;i<n;i++)
	 { 
	 	for(int j=i+1;j<n;j++)
	 	  {
	 	  	if(arr[i]+arr[j]==k)
	 	  	 {
	 	  	 	smallest_length=min(j-i+1,smallest_length);
	 	  	 }
	 	  	 //count++;
	 	  }
	 }
	 cout<<smallest_length;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KI2luY2x1ZGU8dmVjdG9yPgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCXZlY3RvcjxpbnQ+YXJyPXs1LDYsNyw4LDEwLDQsMywyLDF9OwoJaW50IGs9ODsKCWludCBuPWFyci5zaXplKCk7CglpbnQgY291bnQ9MDsKCWludCBzbWFsbGVzdF9sZW5ndGg9SU5UX01BWDsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgkgeyAKCSAJZm9yKGludCBqPWkrMTtqPG47aisrKQoJIAkgIHsKCSAJICAJaWYoYXJyW2ldK2FycltqXT09aykKCSAJICAJIHsKCSAJICAJIAlzbWFsbGVzdF9sZW5ndGg9bWluKGotaSsxLHNtYWxsZXN0X2xlbmd0aCk7CgkgCSAgCSB9CgkgCSAgCSAvL2NvdW50Kys7CgkgCSAgfQoJIH0KCSBjb3V0PDxzbWFsbGVzdF9sZW5ndGg7CglyZXR1cm4gMDsKfQ==