#include<iostream>
#include<algorithm>
#include <direct.h>
#include<fstream>
#include<vector>
using namespace std;
int main()
{
vector<int> a = { 1,2};
int l = 0, r = a.size() - 1;//
int target = 2;
while (l < r)
{
int mid = (l + r) >> 1;
if (a[mid] < target)
l = mid + 1;
else
r = mid;
}
cout << r << endl;
cout << l << endl;
}