

'''simple docstring'''






def 	_A  (					A__  ,       A__   ):






 """simple docstring"""



 if number < 0 or shift_amount < 0:
  raise ValueError('''both inputs must be positive integers'''   )

 __lowercase													=				str(bin(A__   )   )
 binary_number += "0" * shift_amount
 return binary_number


def 	_A  (					A__  ,       A__   ):






 """simple docstring"""



 if number < 0 or shift_amount < 0:
  raise ValueError('''both inputs must be positive integers'''   )

 __lowercase													=				str(bin(A__   )   )[2:]
 if shift_amount >= len(A__   ):
  return "0b0"
 __lowercase													=				binary_number[: len(A__   ) - shift_amount]
 return "0b" + shifted_binary_number


def 	_A  (					A__  ,       A__   ):






 """simple docstring"""



 if number >= 0:  # Get binary representation of positive number
  __lowercase													=				'''0''' + str(bin(A__   )   ).strip('''-'''   )[2:]
 else:  # Get binary (2's complement) representation of negative number
  __lowercase													=				len(bin(A__   )[3:]   )  # Find 2's complement of number
  __lowercase													=				bin(abs(A__   ) - (1 << binary_number_length)   )[3:]
  __lowercase													=				(
      '''1''' + '''0''' * (binary_number_length - len(A__   )) + binary_number
  )

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


if __name__ == "__main__":
 import doctest

 doctest.testmod()




'''simple docstring'''






def 	_A  (					):






 """simple docstring"""



 for n in range(1  ,       1000000   ):
  yield n * (n + 1) // 2


def 	_A  (					A__   ):






 """simple docstring"""



 __lowercase													=				1
 __lowercase													=				2
 while i * i <= n:
  __lowercase													=				0
  while n % i == 0:
   n //= i
   multiplicity += 1
  divisors_count *= multiplicity + 1
  i += 1
 if n > 1:
  divisors_count *= 2
 return divisors_count


def 	_A  (					):






 """simple docstring"""



 return next(i for i in triangle_number_generator() if count_divisors(A__   ) > 500   )


if __name__ == "__main__":
 print(solution())

