#include <bits/stdc++.h>
using namespace std;
vector<int>v={1,2,4,4,5};
void lb(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() {
lb(3); //if number is not present
lb(4); //if number is present
lb(7); //if number if bigger than max
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKdmVjdG9yPGludD52PXsxLDIsNCw0LDV9OwogCnZvaWQgbGIoaW50IG51bSl7CglpbnQgbCA9IDA7CiAgICBpbnQgciA9IHYuc2l6ZSgpLTE7CiAgICB3aGlsZShsPD1yKXsKICAgICAgICBpbnQgbWlkID0gbCArIChyLWwpLzI7CiAgICAgICAgaWYodlttaWRdPG51bSkgbD1taWQrMTsKICAgICAgICBlbHNlIHI9bWlkLTE7CiAgICB9CiAgICBjb3V0PDxsPDxlbmRsOwp9CiAKaW50IG1haW4oKSB7CglsYigzKTsgLy9pZiBudW1iZXIgaXMgbm90IHByZXNlbnQKCWxiKDQpOyAvL2lmIG51bWJlciBpcyBwcmVzZW50CglsYig3KTsgLy9pZiBudW1iZXIgaWYgYmlnZ2VyIHRoYW4gbWF4CglyZXR1cm4gMDsKfQ==