Twin Pairs 2500 pts

Let $G$ be a simple undirected graph with $2n$ vertices and $4n-4$ edges, where $n\ge 2$. Its vertices are partitioned into $n$ pairs.

Suppose that choosing one vertex from each pair always gives a connected induced subgraph.

Prove that in at least two of the pairs, the two vertices have exactly the same neighbors in $G$.