#include <bits/stdc++.h>
using namespace std;
set<int> m[100001];
vector<int> adj[100001];
int res[100001], vis[100001], rp;
int main() {
  int n, a, b, now = 1, last = -1;
  scanf("%d", &n);
  int tv = n;
  for (int i = 0; i < 2 * n; ++i) {
    scanf("%d%d", &a, &b);
    m[a].insert(b);
    m[b].insert(a);
  }
  for (int i = 1; i <= n; ++i) {
    if (m[i].size() != 4) {
      printf("-1\n");
      return 0;
    }
    for (typeof(m[i].begin()) it = m[i].begin(); it != m[i].end(); ++it)
      adj[i].push_back(*it);
  }
  if (n < 7) {
    for (int i = 0; i < n; ++i) res[i] = i + 1;
    bool g = 0;
    do {
      tv = n;
      g = 1;
      for (int i = 0; i < n; ++i) {
        int a = (i + 1) % n;
        int b = ((i - 1) + n) % n;
        int aa = (i + 2) % n;
        int bb = ((i - 2) + n) % n;
        if (!m[res[i]].count(res[a]) || !m[res[i]].count(res[b])) {
          g = 0;
          break;
        }
        if (!m[res[i]].count(res[aa]) || !m[res[a]].count(res[aa])) {
          g = 0;
          break;
        }
        if (!m[res[i]].count(res[bb]) || !m[res[b]].count(res[bb])) {
          g = 0;
          break;
        }
      }
      if (g) {
        tv = 0;
        break;
      }
    } while (next_permutation(res, res + n));
  } else {
    while (1) {
      res[rp++] = now;
      vis[now] = 1;
      --tv;
      map<int, int> rank;
      int choose = -1;
      for (int i = 0; i < adj[now].size(); ++i) {
        int p = adj[now][i];
        for (int j = 0; j < adj[p].size(); ++j) {
          if (m[now].count(adj[p][j])) ++rank[p];
        }
        if (rank[p] >= rank[choose] && !vis[p]) choose = p;
      }
      if (choose == -1) {
        if (!m[now].count(1)) tv = 1;
        break;
      }
      now = choose;
    }
  }
  assert(tv >= 0);
  if (tv) {
    printf("-1\n");
  } else {
    for (int i = 0; i < n; ++i) printf("%d ", res[i]);
    printf("\n");
  }
}
