#include<iostream>

using namespace std;

int main()
{


	_getch();
	return 0;
}

int binary(int x[], int n, int key)
{
	int low = 0;
	int hogh = n - 1;

	while (low <= hogh)
	{
		int mid = (low + hogh) / 2;
		if (key == x[mid])
		{
			return mid;
		}
		if (key < x[mid])
		{
			hi = mid - 1;
		}
		else
		{
			low = mid + 1;
		}

	}
	return -1;
}