
"""simple docstring"""




__lowerCAmelCase							:  Any 				=		{0: [1, 2], 1: [0, 3], 2: [0], 3: [1], 4: [5, 6], 5: [4, 6], 6: [4, 5]}

__lowerCAmelCase							:  str 				=		{0: [1, 2, 3], 1: [0, 3], 2: [0], 3: [0, 1], 4: [], 5: []}

def __snake_case (      UpperCamelCase						,					UpperCamelCase						,					UpperCamelCase    )       ->    list:


		"""simple docstring"""





		a__   		=     True
		a__   		=     []

		for neighbour in graph[vert]:
				if not visited[neighbour]:
						connected_verts += dfs(UpperCamelCase						,					UpperCamelCase						,					UpperCamelCase    )

		return [vert, *connected_verts]

def __snake_case (      UpperCamelCase    )       ->    list:


		"""simple docstring"""





		a__   		=     len(UpperCamelCase    )
		a__   		=     graph_size * [False]
		a__   		=     []

		for i in range(UpperCamelCase    ):
				if not visited[i]:
						a__   		=     dfs(UpperCamelCase						,					UpperCamelCase						,					UpperCamelCase    )
						components_list.append(UpperCamelCase    )

		return components_list


if __name__ == "__main__":
					import doctest

					doctest.testmod()






"""simple docstring"""




def __snake_case (      UpperCamelCase = 10**6    )       ->    int:


		"""simple docstring"""





		if n <= 0:
				raise ValueError('''Please enter an integer greater than 0'''    )

		a__   		=     list(range(n + 1    )    )
		for number in range(2						,					n + 1    ):
				if phi[number] == number:
						phi[number] -= 1
						for multiple in range(number * 2						,					n + 1						,					UpperCamelCase    ):
								a__   		=     (phi[multiple] // number) * (number - 1)

		a__   		=     1
		for number in range(1						,					n + 1    ):
				if (answer / phi[answer]) < (number / phi[number]):
						a__   		=     number

		return answer


if __name__ == "__main__":
					print(solution())




