




def 							_A       (						lowerCAmelCase_					: str       ,    lowerCAmelCase_					: str      ):
     """simple docstring"""

     lowerCAmelCase__          =			len(lowerCAmelCase_      )
     lowerCAmelCase__          =			len(lowerCAmelCase_      )
     lowerCAmelCase__          =			(
         first_str_length if first_str_length > second_str_length else second_str_length
     )
     lowerCAmelCase__          =			[]
     for char_count in range(lowerCAmelCase_      ):
          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(lowerCAmelCase_      )


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






from maths.prime_factors import prime_factors



def 							_A       (						lowerCAmelCase_					: int      ):
     """simple docstring"""

     if not isinstance(lowerCAmelCase_       ,    lowerCAmelCase_      ):
          lowerCAmelCase__          =			F'Input value of [number={number}] must be an integer'
          raise TypeError(lowerCAmelCase_      )
     if number < 1:
          raise ValueError("Input must be a positive integer"      )
     return -1 if len(prime_factors(lowerCAmelCase_      )      ) % 2 else 1


if __name__ == "__main__":
     import doctest

     doctest.testmod()
