consider undirected graph g n vertex there value a_i vertextwo vertice j connected edge gcda_i a_j 1 gcdx y denote great common divisor GCD integer x yConsider set vertex Lets vertex set fair connect edge vertex setyou need find set k vertex k give integer 2 cdot k le n vertex fair vertex fair one set exist