#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<bool> us;
vector<int> ans, cnt;
int n, n2;
bool con(int a, int b) {
  for (int& i : g[a])
    if (i == b) return true;
  return false;
}
bool build(int i) {
  if (i == n) {
    return (con(ans[n - 2], 1) && con(ans[n - 1], 1) &&
            con(ans[n - 1], ans[1]));
  }
  int p1 = ans[i - 1], p2 = ans[i - 2];
  for (int& j : g[p1])
    if (!us[j] && con(j, p2)) {
      ans[i] = j;
      us[j] = true;
      if (build(i + 1)) return true;
      us[j] = false;
      return false;
    }
  return false;
}
bool get_ans() {
  ans[0] = 1;
  us[1] = true;
  for (int& i : g[1])
    for (int& j : g[1]) {
      if (i == j) continue;
      if (con(i, j)) {
        ans[1] = i;
        ans[2] = j;
        us[i] = true;
        us[j] = true;
        if (build(3)) return true;
        us[i] = false;
        us[j] = false;
      }
    }
  return false;
}
void solve() {
  scanf("%d", &n);
  n2 = n << 1;
  g.resize(n + 1);
  us.resize(n + 1);
  cnt.resize(n + 1);
  ans.resize(n);
  for (int(i) = 0; (i) < (n2); ++(i)) {
    int a, b;
    scanf("%d%d", &a, &b);
    ++cnt[a];
    ++cnt[b];
    g[a].push_back(b);
    g[b].push_back(a);
  }
  for (int i = 1; i <= n; ++i)
    if (cnt[i] != 4) {
      printf("-1");
      return;
    }
  if (!get_ans()) {
    printf("-1");
    return;
  }
  for (int(i) = 0; (i) < (n); ++(i)) printf("%d ", ans[i]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
