#include<iostream>
using namespace std;
int binary_search(int arr[], int k, int sz)
{
int left = 0;
int right = sz - 1;
while (left <= right)
{
int mid = left + (right - left) / 2;
if (arr[mid] < k)
{
left = mid + 1;
}
else if (arr[mid] > k)
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}
int main()
{
int i;
int k;
int arr[7] = { 1 ,2, 3, 4, 5 ,99 ,100};
while (cin >>k )
{
int sz = sizeof(arr) / sizeof(arr[0]);
int ret = binary_search(arr, k, sz);
if (ret == -1)
{
cout << "can not find" << endl;
}
else
{
cout << " find" << " the number is: " << ret + 1 << endl;
}
}
return 0;
}