#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

int modpow(int a, long long n, int mod = MOD) { int ret = 1; do { if (n & 1) ret = 1LL * ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
// counterclockwise from 12 o'clock direction
template<typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) { if (a.first * b.first < 0) return a.first < b.first; if (a.first == 0) return a.second >= 0 || b.first > 0; if (b.first == 0) return b.second < 0 && a.first < 0; return a.second * b.first < a.first * b.second; }


/* -------- <templates end> -------- */


void dfs(Graph<int> &g, vi &dist, int p, int v) {
  for (int nv : g[v]) {
    if (nv != p) {
      dist[nv] = dist[v] + 1;
      dfs(g, dist, v, nv);
    }
  }
}

bool dfs2(Graph<int> &g, vi &cnt, int p, int v) {
  int next = -1;
  if (g[v].size() < 3) {
    cnt.emplace_back(0);
    for (int nv : g[v]) {
      if (nv != p) next = nv;
    }
  } else {
    cnt.emplace_back(g[v].size()-2);
    for (int nv : g[v]) {
      if (nv != p && g[nv].size() > 1) {
        if (next != -1) return false;
        next = nv;
      }
    }
    if (next == -1) next = (g[v][0] == p ? g[v][1] : g[v][0]);
  }
  if (next != -1) return dfs2(g, cnt, v, next);
  return true;
}

void solve() {
  int n; cin >> n;
  Graph<int> g(n);
  rep1(i,n) {
    int v, w; cin >> v >> w; --v, --w;
    g[v].emplace_back(w);
    g[w].emplace_back(v);
  }

  vi dist(n);

  dfs(g, dist, -1, 0);

  int p = max_element(ALL(dist)) - dist.begin();
  vi cnt; cnt.reserve(n);

  if (!dfs2(g, cnt, -1, p)) {
    cout << -1 << endl;
    return;
  }

  bool norm;
  int sz = cnt.size();

  rep(i,sz>>1) {
    if (cnt[i] != cnt[sz-1-i]) {
      norm = cnt[i] < cnt[sz-1-i];
      break;
    }
  }

  vi ans; ans.reserve(n);
  int idx = 1;

  if (norm) {
    rep(i,sz) {
      rep1eq(j,cnt[i]) {
        ans.emplace_back(idx+j);
      }
      ans.emplace_back(idx);
      idx += cnt[i] + 1;
    }
  } else {
    rrep(i,sz) {
      rep1eq(j,cnt[i]) {
        ans.emplace_back(idx+j);
      }
      ans.emplace_back(idx);
      idx += cnt[i] + 1;
    }
  }

  cout << ans << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  solve();
  return 0;
}


Measured memory_bytes: 13696