


'''simple docstring'''





def        a__     (					UpperCamelCase_						:      int,   UpperCamelCase_						:      int						):
   if number < 0 or shift_amount < 0:
      raise ValueError('''both inputs must be positive integers'''						)

   UpperCAmelCase__	:Optional[int]      =      str(bin(UpperCamelCase_						)						)
   binary_number += "0" * shift_amount
   return binary_number


def        a__     (					UpperCamelCase_						:      int,   UpperCamelCase_						:      int						):
   if number < 0 or shift_amount < 0:
      raise ValueError('''both inputs must be positive integers'''						)

   UpperCAmelCase__	:Optional[int]      =      str(bin(UpperCamelCase_						)						)[2:]
   if shift_amount >= len(UpperCamelCase_						):
      return "0b0"
   UpperCAmelCase__	:List[Any]      =      binary_number[: len(UpperCamelCase_						) - shift_amount]
   return "0b" + shifted_binary_number


def        a__     (					UpperCamelCase_						:      int,   UpperCamelCase_						:      int						):
   if number >= 0:  # Get binary representation of positive number
      UpperCAmelCase__	:Any      =      '''0''' + str(bin(UpperCamelCase_						)						).strip('''-'''						)[2:]
   else:  # Get binary (2's complement) representation of negative number
      UpperCAmelCase__	:List[str]      =      len(bin(UpperCamelCase_						)[3:]						)  # Find 2's complement of number
      UpperCAmelCase__	:int      =      bin(abs(UpperCamelCase_						) - (1 << binary_number_length)						)[3:]
      UpperCAmelCase__	:Dict      =      (
          '''1''' + '''0''' * (binary_number_length - len(UpperCamelCase_						)) + binary_number
      )

   if shift_amount >= len(UpperCamelCase_						):
      return "0b" + binary_number[0] * len(UpperCamelCase_						)
   return (
       "0b"
       + binary_number[0] * shift_amount
       + binary_number[: len(UpperCamelCase_						) - shift_amount]
   )


if __name__ == "__main__":
    import doctest

    doctest.testmod()







'''simple docstring'''





from functools import reduce

__lowerCamelCase												=						(
    '''73167176531330624919225119674426574742355349194934'''
    '''96983520312774506326239578318016984801869478851843'''
    '''85861560789112949495459501737958331952853208805511'''
    '''12540698747158523863050715693290963295227443043557'''
    '''66896648950445244523161731856403098711121722383113'''
    '''62229893423380308135336276614282806444486645238749'''
    '''30358907296290491560440772390713810515859307960866'''
    '''70172427121883998797908792274921901699720888093776'''
    '''65727333001053367881220235421809751254540594752243'''
    '''52584907711670556013604839586446706324415722155397'''
    '''53697817977846174064955149290862569321978468622482'''
    '''83972241375657056057490261407972968652414535100474'''
    '''82166370484403199890008895243450658541227588666881'''
    '''16427171479924442928230863465674813919123162824586'''
    '''17866458359124566529476545682848912883142607690042'''
    '''24219022671055626321111109370544217506941658960408'''
    '''07198403850962455444362981230987879927244284909188'''
    '''84580156166097919133875499200524063689912560717606'''
    '''05886116467109405077541002256983155200055935729725'''
    '''71636269561882670428252483600823257530420752963450'''
)


def        a__     (					UpperCamelCase_						:      str = N						):
   return max(
       # mypy cannot properly interpret reduce
       int(reduce(lambda UpperCamelCase_,   UpperCamelCase_						: str(int(UpperCamelCase_						) * int(UpperCamelCase_						)						),   n[i : i + 13]						)						)
       for i in range(len(UpperCamelCase_						) - 12						)						)


if __name__ == "__main__":
    print(F'''{solution() = }''')



