def bit_size(num):
 if (num == 0):
  return 0
 if (num < 0):
  num = (- num)
 (num & 1)
 hex_num = ('%x' % num)
 return (((len(hex_num) - 1) * 4) + {'0': 0, '1': 1, '2': 2, '3': 2, '4': 3, '5': 3, '6': 3, '7': 3, '8': 4, '9': 4, 'a': 4, 'b': 4, 'c': 4, 'd': 4, 'e': 4, 'f': 4}[hex_num[0]])

def bit_size ( num ) : if ( num == 0 ) : return 0 if ( num < 0 ) : num = ( - num ) ( num & 1 ) hex_num = ( '%x' % num ) return ( ( ( len ( hex_num ) - 1 ) * 4 ) + { '0' : 0 , '1' : 1 , '2' : 2 , '3' : 2 , '4' : 3 , '5' : 3 , '6' : 3 , '7' : 3 , '8' : 4 , '9' : 4 , 'a' : 4 , 'b' : 4 , 'c' : 4 , 'd' : 4 , 'e' : 4 , 'f' : 4 } [ hex_num [ 0 ] ] )
number of bits needed to represent a integer excluding any prefix 0 bits .