#include<iostream>
using namespace std;
int two_search(int q[ ],l,r,x)
{
int mid = (l+r) / 2;
if(x=q[mid])return mid;
if(x>q[mid])l = mid + 1;
if(x<q[mid])r = mid - 1;
return -1;
}
#include<iostream>
using namespace std;
int two_search(int q[ ],l,r,x)
{
int mid = (l+r) / 2;
if(x=q[mid])return mid;
if(x>q[mid])l = mid + 1;
if(x<q[mid])r = mid - 1;
return -1;
}