You want to label the vertices (corners) of a regular octahedron (see Figure 3) with whole numbers bigger than one so that the labels of two vertices have a common factor (bigger than one) if and only if they are adjacent on the octahedron (connected by an edge). Is it possible? If so, what is the minimum possible sum of the labels?