


'''simple docstring'''
def 					lowerCamelCase_ ( __UpperCamelCase					:       Optional[int]		)					->	List[Any]:







     """simple docstring"""
     _A				=							1
     _A				=							2
     while i * i <= n:
          _A				=							0
          while n % i == 0:
               n //= i
               multiplicity += 1
          n_divisors *= multiplicity + 1
          i += 1
     if n > 1:
          n_divisors *= 2
     return n_divisors

def 					lowerCamelCase_ ( )					->	Optional[int]:







     """simple docstring"""
     _A				=							1
     _A				=							1

     while True:
          i += 1
          t_num += i

          if count_divisors(__UpperCamelCase		) > 5_0_0:
               break

     return t_num


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









'''simple docstring'''
def 					lowerCamelCase_ ( __UpperCamelCase					:       int							,    __UpperCamelCase					:       int		)					->	int:







     """simple docstring"""
     while second != 0:
          _A				=							first & second
          first ^= second
          _A				=							c << 1
     return first


if __name__ == "__main__":
    import doctest

    doctest.testmod()

    lowerCAmelCase						=					int(input("""Enter the first number: """).strip())
    lowerCAmelCase						=					int(input("""Enter the second number: """).strip())
    print(F'{add(first, second) = }')





