






'''simple docstring'''







def     A__      (					):
						for n in range(1 ,     100_0000    ):
												yield n * (n + 1) // 2
def     A__      (					__lowerCAmelCase		:      Union[str, Any]    ):
						lowerCamelCase__								=	1
						lowerCamelCase__								=	2
						while i * i <= n:
												lowerCamelCase__								=	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__      (					):
						return next(i for i in triangle_number_generator() if count_divisors(__lowerCAmelCase    ) > 500    )


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) = }')





