






'''simple docstring'''




def       __lowercase		(    __lowercase ) ->		float:

      '''simple docstring'''


      return -num if num < 0 else num

def       __lowercase		(    __lowercase ) ->		int:

      '''simple docstring'''


      if len(__lowercase ) == 0:
            raise ValueError("abs_min() arg is an empty sequence" )
      _A      =			x[0]
      for i in x:
            if abs_val(__lowercase ) < abs_val(__lowercase ):
                  _A      =			i
      return j

def       __lowercase		(    __lowercase ) ->		int:

      '''simple docstring'''


      if len(__lowercase ) == 0:
            raise ValueError("abs_max() arg is an empty sequence" )
      _A      =			x[0]
      for i in x:
            if abs(__lowercase ) > abs(__lowercase ):
                  _A      =			i
      return j

def       __lowercase		(    __lowercase ) ->		int:

      '''simple docstring'''


      if len(__lowercase ) == 0:
            raise ValueError("abs_max_sort() arg is an empty sequence" )
      return sorted(__lowercase     ,						key=__lowercase )[-1]

def       __lowercase		(    ) ->		List[Any]:

      '''simple docstring'''


      assert abs_val(0 ) == 0
      assert abs_val(34 ) == 34
      assert abs_val(-1000_0000_0000 ) == 1000_0000_0000

      _A      =			[-3, -1, 2, -11]
      assert abs_max(__lowercase ) == -11
      assert abs_max_sort(__lowercase ) == -11
      assert abs_min(__lowercase ) == -1


if __name__ == "__main__":
    import doctest

    doctest.testmod()

    test_abs_val()
    print(abs_val(-34))  # --> 34













'''simple docstring'''




import math

def       __lowercase		(    __lowercase ) ->		bool:

      '''simple docstring'''


      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or number % 2 == 0 or number % 3 == 0:
            # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
            return False

      # All primes number are in format of 6k +/- 1
      for i in range(5     ,						int(math.sqrt(__lowercase ) + 1 )     ,						6 ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True

def       __lowercase		(    __lowercase = 6008_5147_5143 ) ->		int:

      '''simple docstring'''


      try:
            _A      =			int(__lowercase )
      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." )
      _A      =			0
      if is_prime(__lowercase ):
            return n
      while n % 2 == 0:
            n //= 2
      if is_prime(__lowercase ):
            return n
      for i in range(3     ,						int(math.sqrt(__lowercase ) ) + 1     ,						2 ):
            if n % i == 0:
                  if is_prime(n // i ):
                        _A      =			n // i
                        break
                  elif is_prime(__lowercase ):
                        _A      =			i
      return max_number


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





