"""simple docstring"""



def      _lowerCamelCase(     a					,  a							):


       while b:
              __a      ,					__a	      =  b, a % b
       return a



def      _lowerCamelCase(     a					,  a							):
       return a if b == 0 else euclidean_gcd_recursive(__A					,  a % b							)



def      _lowerCamelCase(     ):
       print(F"euclidean_gcd(3, 5) = {euclidean_gcd(3					,  5							)}"							)
       print(F"euclidean_gcd(5, 3) = {euclidean_gcd(5					,  3							)}"							)
       print(F"euclidean_gcd(1, 3) = {euclidean_gcd(1					,  3							)}"							)
       print(F"euclidean_gcd(3, 6) = {euclidean_gcd(3					,  6							)}"							)
       print(F"euclidean_gcd(6, 3) = {euclidean_gcd(6					,  3							)}"							)

       print(F"euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3					,  5							)}"							)
       print(F"euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5					,  3							)}"							)
       print(F"euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1					,  3							)}"							)
       print(F"euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3					,  6							)}"							)
       print(F"euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6					,  3							)}"							)


if __name__ == "__main__":
   main()

def    lowerCAmelCase_ (     __A,  __A							)     ->				None:







      '''simple docstring'''


      UpperCAmelCase__								=  len(__A							)
      print("The following activities are selected:"							)

      # The first activity is always selected
      UpperCAmelCase__								=  0
      print(__A,  end=","							)

      # Consider rest of the activities
      for j in range(__A							):
            # 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(__A,  end=","							)
                  UpperCAmelCase__								=  j


if __name__ == "__main__":
      import doctest

      doctest.testmod()

      UpperCamelCase__											=					[1, 3, 0, 5, 8, 5]
      UpperCamelCase__											=					[2, 4, 6, 7, 9, 9]
      print_max_activities(start, finish)



