def trailing(n):
 n = int(n)
 if (not n):
  return 0
 low_byte = (n & 255)
 if low_byte:
  return small_trailing[low_byte]
 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 & 255 ) if low_byte : return small_trailing [ low_byte ] 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
count the number of trailing zero digits in the binary representation of n .