
import math





def     _a					(						lowerCamelCase							):
 assert isinstance(lowerCamelCase,	lowerCamelCase							) and (
     number >= 0
 ), "'number' must been an int and positive"

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

 lowerCamelCase		:	int							=      range(3,	int(math.sqrt(lowerCamelCase							) + 1							),	2							)
 return not any(not number % i for i in odd_numbers							)





def     _a					(						lowerCamelCase,	lowerCamelCase=1,	**lowerCamelCase							):
 lowerCamelCase		:	int							=      factor * value
 lowerCamelCase		:	str							=      value

 while not is_prime(lowerCamelCase							):
  value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

 if value == first_value_val:
  return next_prime(value + 1,	**lowerCamelCase							)
 return value






def     _a					(						lowerCamelCase							):
 return " ".join(
     """""".join(word[::-1]							) if len(lowerCamelCase							) > 4 else word for word in sentence.split()							)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      print(reverse_long_words("""Hey wollef sroirraw"""))




