do we need lo+(hi-lo)//2 for binary search in python

I used to do lo+(hi-lo)/2 in binary search in java

As we do not have int overflow in python, Do I need to do it in python?

(lo+hi)//2 is enough?

I am not using any library

references Why we write lo+(hi-lo)/2 in binary search? Integer overflow in Python3