#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1, x2), gn(x3);
}
template <class T1, class T2, class T3, class T4>
inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4) {
  gn(x1, x2), gn(x3, x4);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
template <class T1, class T2, class T3, class T4>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {
  printsp(x1), printsp(x2), printsp(x3), println(x4);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
vector<int> adj[100010], ans;
int n, a, b, c;
int vst[100010];
void solve() {
  ans.clear();
  memset(vst, 0, sizeof vst);
  ans.push_back(a);
  ans.push_back(b);
  ans.push_back(c);
  vst[a] = vst[b] = vst[c] = 1;
  int flag = 1;
  for (int step = 3; step < n && flag; step++) {
    flag = 0;
    for (int i = 0; i < 4 && flag == 0; i++) {
      int u = adj[b][i];
      if (vst[u]) continue;
      for (int j = 0; j < 4 && flag == 0; j++) {
        int v = adj[c][j];
        if (vst[v]) continue;
        if (u == v) {
          flag = 1;
          ans.push_back(u);
          vst[u] = 1;
          a = b, b = c, c = u;
        }
      }
    }
  }
  if (flag) {
    for (int i = 0; i < ans.size(); i++) printsp(ans[i]);
    exit(0);
  }
}
int main() {
  gn(n);
  for (int i = 0; i < 2 * n; i++) {
    int u, v;
    gn(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; i++)
    if (adj[i].size() != 4) {
      puts("-1");
      return 0;
    }
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < 4; j++)
      if (i != j) {
        a = 1, b = adj[1][i], c = adj[1][j];
        solve();
      }
  }
  puts("-1");
}
