A chain p is given in a directed graph without loops or multiple edges. It is required to specify its subchain q such that

• the initial and final vertices of the chains p and q coincide;
• the edges in the chain q are in the same order as in the chain p;
• the chain q has the minimal possible number of edges under the given conditions.

The chain p is given by the list of its vertices. The first line contains the number n of vertices in the list, 2 ≤ n ≤ 100000 (thus, the length of the chain is n−1). The following lines contain n numbers of vertices (they are integers in the range from 1 to 10000). The numbers are separated by spaces or linebreaks. No two successive vertices in the list coincide.

Output the vertices of the chain q by giving their numbers separated by a space. Chain q may consist of single a vertex.