#include <fstream.h>

int v,i,j,n;
int cautare(int p, int u)
{
  int m;
  m=(p+u)/2;
  while (p<=u){
      for (i=0;i<n-2;++i)
    	for (j=0;j<n-1;++j){
      	   caut(1,n);}
	if ((v[m]<=v[i]+v[j] && v[m+1]>v[i]+v[j]) || (v[m]<=v[i]+v[j] && m==n-1))
		  return m;
	  else if (v[m]<=v[i]+v[j] && v[m+1]<=v[i]+v[j]) {
		  p=m+1; 
		  m=(p+u)/2;
	  }
	  else {
		  u=m-1; 
		  m=(p+u)/2;
		  }  
  }
  return 0;
}