Problem: One day Vasya came up to the blackboard and wrote out n distinct integers from 1 to n in some order in a circle. Then he drew arcs to join the pairs of integers (a, b) (a ≠ b), that are either each other's immediate neighbors in the circle, or there is number c, such that a and с are immediate neighbors, and b and c are immediate neighbors. As you can easily deduce, in the end Vasya drew 2·n arcs.

For example, if the numbers are written in the circle in the order 1, 2, 3, 4, 5 (in the clockwise direction), then the arcs will join pairs of integers (1, 2), (2, 3), (3, 4), (4, 5), (5, 1), (1, 3), (2, 4), (3, 5), (4, 1) and (5, 2).

Much time has passed ever since, the numbers we wiped off the blackboard long ago, but recently Vasya has found a piece of paper with 2·n written pairs of integers that were joined with the arcs on the board. Vasya asks you to find the order of numbers in the circle by these pairs.

Input

The first line of the input contains a single integer n (5 ≤ n ≤ 105) that shows, how many numbers were written on the board. Next 2·n lines contain pairs of integers ai, bi (1 ≤ ai, bi ≤ n, ai ≠ bi) — the numbers that were connected by the arcs.

It is guaranteed that no pair of integers, connected by a arc, occurs in the input more than once. The pairs of numbers and the numbers in the pairs are given in the arbitrary order.

Output

If Vasya made a mistake somewhere and there isn't any way to place numbers from 1 to n on the circle according to the statement, then print a single number "-1" (without the quotes). Otherwise, print any suitable sequence of n distinct integers from 1 to n. 

If there are multiple solutions, you are allowed to print any of them. Specifically, it doesn't matter which number you write first to describe the sequence of the order. It also doesn't matter whether you write out the numbers in the clockwise or counter-clockwise direction.

Examples

Input

5
1 2
2 3
3 4
4 5
5 1
1 3
2 4
3 5
4 1
5 2


Output

1 2 3 4 5 

Input

6
5 6
4 3
5 3
2 4
6 1
3 1
6 2
2 5
1 4
3 6
1 2
4 5


Output

1 2 4 5 3 6 

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

public class circleNums {

  static ArrayList<Integer> path = new ArrayList<Integer>();
  static ArrayList<Integer>[] graph = null;
  static boolean[] visited = null;
  static boolean found = false;
  static int n = -1;
  public static void main(String[] args) throws Exception {
    BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
    BufferedWriter w = new BufferedWriter(new OutputStreamWriter(System.out));
    n = Integer.parseInt(r.readLine());
    int[] frq = new int[n];
    graph = new ArrayList[n];
    for (int i = 0; i < n; i++) graph[i] = new ArrayList<Integer>();
    visited = new boolean[n];
    for (int i = 0; i < n; i++) {
      frq[i] = 0;
      visited[i] = false;
    }
    for (int i = 0; i < 2 * n; i++) {
      StringTokenizer st = new StringTokenizer(r.readLine());
      int a = Integer.parseInt(st.nextToken()) - 1;
      int b = Integer.parseInt(st.nextToken()) - 1;
      frq[a]++; frq[b]++;
      graph[a].add(b); graph[b].add(a);
    } 
    boolean no = false;
    for (int i = 0; i < n; i++) {
      if (frq[i] != 4) {
        no = true;
        break;
      }
    }
    if (no) {
      w.write("-1\n");
      w.close();
      System.exit(0);
    }
    dfs(0, -1);
    String s = "";
    if (path.size() == 0) {
      w.write("-1\n");
      w.close();
      System.exit(0);
    }
    for (Integer i: path) {
      w.write(s + (i + 1));
      s = " "; 
    }
    w.write("\n");
    w.close();
    System.exit(0);
  }
  public static void dfs(int vertex, int prev) {
    if (found) return;
    visited[vertex] = true;
    path.add(vertex);
    if (path.size() == n) {
      found = true;
      return;
    }
    for (int i = 0; i < graph[vertex].size(); i++) {
      int node = graph[vertex].get(i);
      if (vertex == 0) {
        if (!visited[node]) {
          dfs(node, vertex);
          if (found) return;
        }
      } else {
        boolean indicator = false;
        for (int j = 0; j < graph[prev].size(); j++) {
          if (graph[prev].get(j) == node) {
            indicator = true; break;
          }
        }
        if (!visited[node] && indicator) {
          dfs(node, vertex);
          if (found) return;
        }
      }     
    }
    if (found) return;
    visited[vertex] = false;
    path.remove(path.size() - 1);
  }
}