


lowerCAmelCase__    :Tuple       =				"Tobias Carryer"

from time import time

class 						__a :
		def __init__(     self     ,       _SCREAMING_SNAKE_CASE     ,       _SCREAMING_SNAKE_CASE     ,       _SCREAMING_SNAKE_CASE     ,       _SCREAMING_SNAKE_CASE=int(time()		)		)					->			List[Any]:  # noqa: B008




									"""simple docstring"""





									_UpperCAmelCase											=     multiplier
									_UpperCAmelCase											=     increment
									_UpperCAmelCase											=     modulo
									_UpperCAmelCase											=     seed






		def       UpperCAmelCase__							(     self		)					->			Tuple:




									"""simple docstring"""





									_UpperCAmelCase											=     (self.multiplier * self.seed + self.increment) % self.modulo
									return self.seed


if __name__ == "__main__":
		# Show the LCG in action.
		lowerCAmelCase__    :str       =				LinearCongruentialGenerator(1_6_6_4_5_2_5, 1_0_1_3_9_0_4_2_2_3, 2 << 3_1)
		while True:
				print(lcg.next_number())





def 	_lowerCAmelCase (    A__ = 600_851_475_143						):

      try:
            lowercase__  =	int(A__						)
      except (TypeError, ValueError):
            raise TypeError('Parameter n must be int or castable to int.'						)
      if n <= 0:
            raise ValueError('Parameter n must be greater than or equal to one.'						)
      lowercase__  =	2
      lowercase__  =	0
      if n == 2:
            return 2
      while n > 2:
            while n % i != 0:
                  i += 1
            lowercase__  =	i
            while n % i == 0:
                  lowercase__  =	n // i
            i += 1
      return int(A__						)


if __name__ == "__main__":
       print(F'''{solution() = }''')
