"""simple docstring"""







def   __UpperCAmelCase    (   UpperCAmelCase_   :    str      ,							UpperCAmelCase_   :    str  )							->      str:

	'''simple docstring'''





	__snake_case      :							int						=			len(UpperCAmelCase_  )
	__snake_case      :							int						=			len(UpperCAmelCase_  )
	__snake_case      :							int						=			(
	    first_str_length if first_str_length > second_str_length else second_str_length
	)
	__snake_case      :							list						=			[]
	for char_count in range(UpperCAmelCase_  ):
		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(UpperCAmelCase_  )


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






"""simple docstring"""







def   __UpperCAmelCase    (   UpperCAmelCase_   :    int      ,							UpperCAmelCase_   :    int  )							->      int:

	'''simple docstring'''





	while a != 0:
		__snake_case		,    __snake_case      :							Union[str, Any]						=			b % a, a
	return b

def   __UpperCAmelCase    (   UpperCAmelCase_   :    int      ,							UpperCAmelCase_   :    int  )							->      int:

	'''simple docstring'''





	if gcd(UpperCAmelCase_      ,							UpperCAmelCase_  ) != 1:
		__snake_case      :							Union[str, Any]						=			F"mod inverse of {a!r} and {m!r} does not exist"
		raise ValueError(UpperCAmelCase_  )
	__snake_case		,    __snake_case		,    __snake_case      :							List[str]						=			1, 0, a
	__snake_case		,    __snake_case		,    __snake_case      :							Dict						=			0, 1, m
	while va != 0:
		__snake_case      :							List[str]						=			ua // va
		__snake_case		,    __snake_case		,    __snake_case		,    __snake_case		,    __snake_case		,    __snake_case      :							List[str]						=			(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
	return ua % m





