#include <bits/stdc++.h>
using namespace std;
vector<int>v={1,2,4,4,5};
void ub(int num){
int l = 0;
int r = v.size()-1;
while(l<=r){
int mid = l + (r-l)/2;
if(v[mid]<=num) l=mid+1;
else r=mid-1;
}
cout<<l<<endl;
}
int main() {
ub(3); //if number is not present
ub(4); //if number is present
ub(7); //if number if bigger than max
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKdmVjdG9yPGludD52PXsxLDIsNCw0LDV9OwogCnZvaWQgdWIoaW50IG51bSl7CglpbnQgbCA9IDA7CiAgICBpbnQgciA9IHYuc2l6ZSgpLTE7CiAgICB3aGlsZShsPD1yKXsKICAgICAgICBpbnQgbWlkID0gbCArIChyLWwpLzI7CiAgICAgICAgaWYodlttaWRdPD1udW0pIGw9bWlkKzE7CiAgICAgICAgZWxzZSByPW1pZC0xOwogICAgfQogICAgY291dDw8bDw8ZW5kbDsKfQogCmludCBtYWluKCkgewoJdWIoMyk7IC8vaWYgbnVtYmVyIGlzIG5vdCBwcmVzZW50Cgl1Yig0KTsgLy9pZiBudW1iZXIgaXMgcHJlc2VudAoJdWIoNyk7IC8vaWYgbnVtYmVyIGlmIGJpZ2dlciB0aGFuIG1heAoJcmV0dXJuIDA7Cn0=