Description

In this problem, a tree is an undirected graph that is connected and has no cycles.

You are given a graph that started as a tree with n nodes labeled from 1 to n, with one additional edge added.

The added edge has two different vertices chosen from 1 to n, and was not an edge that already existed.

Return the edge that can be removed so that the resulting graph is a tree again. If there are multiple answers, return the one that occurs last in the input.

Input format:

• Line 1: JSON array of edges

Examples

Input:
[[1,2],[1,3],[2,3]]

Output:
[2,3]

Input:
[[1,2],[2,3],[3,4],[1,4],[1,5]]

Output:
[1,4]

Note:

Your program must print the redundant edge as a JSON array.
USE : print(str(findRedundantConnection(x)).replace(" ", "")) in Python