
def 				a						(							snake_case__:					list[int]						,   snake_case__:					list[int]					):


				'''simple docstring'''
				lowercase_       =					len(snake_case__					)
				print('''The following activities are selected:'''					)

				# The first activity is always selected
				lowercase_       =					0
				print(snake_case__						,   end=''','''					)

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


if __name__ == "__main__":
						import doctest

						doctest.testmod()

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






def 				a						(							snake_case__:					list					):


				'''simple docstring'''

				if len(snake_case__					) <= 1:
								return [tuple(snake_case__					)]

				lowercase_       =					[]

				def generate(snake_case__:					int						,   snake_case__:					list					):
								if k == 1:
												res.append(tuple(arr[:]					)					)
												return

								generate(k - 1						,   snake_case__					)

								for i in range(k - 1					):
												if k % 2 == 0:  # k is even
																lowercase_  ,	lowercase_       =					arr[k - 1], arr[i]
												else:  # k is odd
																lowercase_  ,	lowercase_       =					arr[k - 1], arr[0]
												generate(k - 1						,   snake_case__					)

				generate(len(snake_case__					)						,   snake_case__					)
				return res


if __name__ == "__main__":
						__a  			=					input('Enter numbers separated by a comma:\n').strip()
						__a  			=					[int(item) for item in user_input.split(',')]
						print(heaps(arr))




