def babylonian_squareroot(number):
    
    if(number == 0):
        return 0;
    g = number/2.0;
    g2 = g + 1;
    while(g != g2):
        n = number/ g;
        g2 = g;
        g = (g + n)/2;
    return g;
def babylonian_squareroot(number):
    if number == 0:
        return 0
    VAR_0 = number / 2.0
    g2 = VAR_0 + 1
   
    while VAR_0 != g2:
        n = number / VAR_0
        g2 = VAR_0
        VAR_0 = (VAR_0 + n) / 2
    return VAR_0