




'''simple docstring'''



lowerCamelCase_			=						'Tobias Carryer'

from time import time







class 		lowercase_   :


   """simple docstring"""

   def __init__(   self :     Tuple  ,				__lowerCamelCase :     int  ,				__lowerCamelCase :     List[Any]  ,				__lowerCamelCase :     Optional[int]  ,				__lowerCamelCase :     Dict=int(time()   )   ):  # noqa: B008

      """simple docstring"""
      _SCREAMING_SNAKE_CASE	=				multiplier
      _SCREAMING_SNAKE_CASE	=				increment
      _SCREAMING_SNAKE_CASE	=				modulo
      _SCREAMING_SNAKE_CASE	=				seed



   def 							lowerCAmelCase_      (   self :     List[str]   ):

      """simple docstring"""
      _SCREAMING_SNAKE_CASE	=				(self.multiplier * self.seed + self.increment) % self.modulo
      return self.seed


if __name__ == "__main__":
 # Show the LCG in action.
 lowerCamelCase_			=						LinearCongruentialGenerator(1_66_45_25, 10_13_90_42_23, 2 << 31)
 while True:
  print(lcg.next_number())







'''simple docstring'''



def 			SCREAMING_SNAKE_CASE_			(							__A    :			str	,					__A    :			str  )			->			str:
   _SCREAMING_SNAKE_CASE	=				len(__A  )
   _SCREAMING_SNAKE_CASE	=				len(__A  )
   _SCREAMING_SNAKE_CASE	=				(
       first_str_length if first_str_length > second_str_length else second_str_length
   )
   _SCREAMING_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=' ')

