#include <iostream>
using namespace std;
int find(int arr[],int len,int key){
int low=0,high=len-1,mid;
while(high>=low){
mid = (high + low)/2;
if(arr[mid]==key){
return mid+1;
}else if(key<arr[mid]){
low=mid+1;
}else{
high=mid-1;
}
}
return -1;
}
int main() {
int arr[] = {85,63,52,34,25,17,6};
int key = 6;
int findResult = find(arr,sizeof(arr)/sizeof(int),key);
cout << findResult << endl;
return 0;
}