




def 		lowerCamelCase__       (						_A	,      _A				):







	'''simple docstring'''





	snake_case_						       =	len(_A				)
	snake_case_						       =	len(_A				)
	snake_case_						       =	(
	    first_str_length if first_str_length > second_str_length else second_str_length
	)
	snake_case_						       =	[]
	for char_count in range(_A				):
		if char_count < first_str_length:
			output_list.append(first_str[char_count]				)
		if char_count < second_str_length:
			output_list.append(second_str[char_count]				)
	return "".join(_A				)


if __name__ == "__main__":
		print(alternative_string_arrange("AB", "XYZ"), end=" ")






def 		lowerCamelCase__       (						):







	'''simple docstring'''





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


def 		lowerCamelCase__       (						_A				):







	'''simple docstring'''





	snake_case_						       =	1
	snake_case_						       =	2
	while i * i <= n:
		snake_case_						       =	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 		lowerCamelCase__       (						):







	'''simple docstring'''





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


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