(n)
return t
Count the number of trailing zero digits in the binary
    representation of n, i.e. determine the largest power of 2
    that divides n.

    Examples
    ========

    >>> from sympy import trailing
    >>> trailing(128)
    7
    >>> trailing(63)
    0
Count the number of trailing zero digits in the binary
    representation of n, i.e. determine the largest power of 2
    that divides n.
Count the number of trailing zero digits in the binary representation of n i . e . determine the largest power of 2 that divides n .
def trailing(n):
    """Count the number of trailing zero digits in the binary
    representation of n, i.e. determine the largest power of 2
    that divides n.

    Examples
    ========

    >>> from sympy import trailing
    >>> trailing(128)
    7
    >>> trailing(63)
    0
    """
    n = int(n)
    if not n:
        return 0
    low_byte = n & 0xff
    if low_byte:
        return small_trailing[low_byte]

    # 2**m is quick for z up through 2**30
    z = bitcount(n) - 1
    if isinstance(z, SYMPY_INTS):
        if n == 1 << z:
            return z

    t = 0
    p = 8
    while not n & 1:
        while not n & ((1 << p) - 1):
            n >>= p
            t += p
            p *= 2
        p //= 2
    return t
def trailing ( n ) : n = int ( n ) if not n : return 0 low_byte = n & 0xff if low_byte : return small_trailing [ low_byte ] # 2**m is quick for z up through 2**30 z = bitcount ( n ) - 1 if isinstance ( z , SYMPY_INTS ) : if n == 1 << z : return z t = 0 p = 8 while not n & 1 : while not n & ( ( 1 << p ) - 1 ) : n >>= p t += p p *= 2 p //= 2 return t