'''simple docstring'''




def _lowercase	(      lowerCamelCase__							,    lowerCamelCase__						)					->       None:





       """simple docstring"""


       __UpperCAmelCase  :				str       				=		len(lowerCamelCase__						)
       print("The following activities are selected:"						)

       # The first activity is always selected
       __UpperCAmelCase  :				int       				=		0
       print(lowerCamelCase__							,    end=","						)

       # Consider rest of the activities
       for j in range(lowerCamelCase__						):
              # If this activity has start time greater than
              # or equal to the finish time of previously
              # selected activity, then select it
              if start[j] >= finish[i]:
                     print(lowerCamelCase__							,    end=","						)
                     __UpperCAmelCase  :				Tuple       				=		j


if __name__ == "__main__":
   import doctest

   doctest.testmod()

   _a   :	Any 							=   [1, 3, 0, 5, 8, 5]
   _a   :	Union[str, Any] 							=   [2, 4, 6, 7, 9, 9]
   print_max_activities(start, finish)







'''simple docstring'''




from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors

def _lowercase	(      lowerCamelCase__						)					->       int:





       """simple docstring"""


       __UpperCAmelCase  :				Any       				=		prime_factors(lowerCamelCase__						)
       if is_square_free(lowerCamelCase__						):
              return -1 if len(lowerCamelCase__						) % 2 else 1
       return 0


if __name__ == "__main__":
   import doctest

   doctest.testmod()






