#include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int>> ti;
vector<long long int> s[300005], f(300005, 0), a(300005, 0);
set<long long int> p[300005];
vector<long long int> d(300005, 0);
map<pair<long long int, long long int>, long long int> mp;
vector<pair<pair<long long int, long long int>, long long int>> st;
map<long long int, long long int> vt;
queue<long long int> qy;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int bpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
void fact(long long int i) {
  f[0] = 1;
  for (long long int k = 1; k <= i; k++) {
    (f[k] = f[k - 1] * k) %= 1000000007;
  }
}
long long int isprime(long long int n) {
  if (n == 1) return 0;
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
long long int find(long long int x) {
  if (f[x] == x)
    return x;
  else
    return f[x] = find(f[x]);
}
bool cmp(long long int x, long long int y) { return x < y; }
long long int comb(long long int i, long long int j) {
  long long int k = f[i];
  long long int g = (f[j] * (f[i - j])) % 1000000007;
  long long int h = bpow(g, 1000000007 - 2);
  return (k * h) % 1000000007;
}
vector<long long int> k;
long long int n;
bool check(long long int i, long long int u, long long int pr) {
  if (pr > 0 && p[pr].count(u) == 0) return false;
  long long int cnt = 0;
  for (auto g : p[i]) {
    for (auto h : p[u]) {
      if (g == h) cnt++;
    }
  }
  if (cnt >= 2) return true;
  return false;
}
void dfs(long long int i, long long int pr) {
  f[i] = 1;
  k.push_back(i);
  for (auto u : p[i]) {
    if (f[u] == 0 && check(i, u, pr)) {
      dfs(u, i);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  long long int x, y;
  vector<pair<long long int, long long int>> g(2 * n);
  for (long long int i = 0; i < 2 * n; i++) {
    cin >> x >> y;
    p[x].insert(y);
    p[y].insert(x);
    d[x]++;
    d[y]++;
  }
  long long int j = 0;
  for (long long int i = 1; i <= n; i++)
    if (d[i] != 4) j = 1;
  if (j) {
    cout << -1 << "\n";
    exit(0);
  }
  dfs(1, 0);
  if (k.size() != n) {
    cout << -1 << "\n";
    exit(0);
  }
  for (long long int i = 0; i < k.size(); i++) cout << k[i] << " ";
}
