Imagine a bunch of pairwise distinct integer numbers a[0], a[1] , ..., a[n - 1] placed on a circle in the same order. There are n pairs of neighboring numbers: (a[o], a[1]) (a[1], a[2]). (a[n - 2], a[n - 1]), (a[n 1], a[0]) 1 2 3 4 } You tried to encode the circle of numbers by recording the pairs, but unfortunately the numbers in these pairs got shuffled, so now each pair (x, y) could be represented either as (x, y) or (y, x). You are given an array pairs of these shuffled pairs, and your task is to return the initial state of the numbers on the circle. Please, note that any cyclic rotation of the initial state is also considered to be a correct