Takahashi has an ability to generate a tree using a permutation (p_1,p_2,...,p_n) of (1,2,...,n), in the following process:

First, prepare Vertex 1, Vertex 2, ..., Vertex N. For each i=1,2,...,n, perform the following operation:

* If p_i = 1, do nothing.
* If p_i \neq 1, let j' be the largest j such that p_j < p_i. Span an edge between Vertex i and Vertex j'.



Takahashi is trying to make his favorite tree with this ability. His favorite tree has n vertices from Vertex 1 through Vertex n, and its i-th edge connects Vertex v_i and w_i. Determine if he can make a tree isomorphic to his favorite tree by using a proper permutation. If he can do so, find the lexicographically smallest such permutation.

Constraints

* 2 \leq n \leq 10^5
* 1 \leq v_i, w_i \leq n
* The given graph is a tree.

Input

Input is given from Standard Input in the following format:


n
v_1 w_1
v_2 w_2
:
v_{n-1} w_{n-1}


Output

If there is no permutation that can generate a tree isomorphic to Takahashi's favorite tree, print `-1`. If it exists, print the lexicographically smallest such permutation, with spaces in between.

Examples

Input

6
1 2
1 3
1 4
1 5
5 6


Output

1 2 4 5 3 6


Input

6
1 2
2 3
3 4
1 5
5 6


Output

1 2 3 4 5 6


Input

15
1 2
1 3
2 4
2 5
3 6
3 7
4 8
4 9
5 10
5 11
6 12
6 13
7 14
7 15


Output

-1
#include<bits/stdc++.h>
using namespace std;

int n, dist[2][100005];

vector<int> adj[100005], v, a, p1, p2;

void calc (int I, int C, int P) {
	for(auto &T : adj[C]) {
		if(T == P) continue;
		dist[I][T] = dist[I][C] + 1;
		calc(I, T, C);
	}
}

bool getp (int C, int P, int O) {
	if(C == O) {v.push_back(C); return true;}
	for(auto &T : adj[C]) {
		if(T == P) continue;
		if(getp(T, C, O)) {v.push_back(C); return true;}
	}
	return false;
}

void solve (vector<int> &A) {
	A.push_back(1);
	int S = 1;
	for(int i=0;i<(int)a.size();i++) {
		for(int j=1;j<=a[i];j++) A.push_back(S+j+1);
		A.push_back(S+1);
		S += a[i]+1;
	}
	A.push_back(n);
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<n;i++) {
		int A, B;
		scanf("%d%d",&A,&B);
		adj[A].push_back(B);
		adj[B].push_back(A);
	}
	int x = 0, y = 0;
	calc(0, 1, 0);
	for(int i=1;i<=n;i++) if(dist[0][i] > dist[0][x]) x=i;
	calc(1, x, 0);
	for(int i=1;i<=n;i++) if(dist[1][i] > dist[1][y]) y=i;
	getp(x, 0, y);
	int S = (int)v.size()-1;
	for(int i=1;i+1<(int)v.size();i++) {
		int T = (int)adj[v[i]].size()-2;
		a.push_back(T);
		S += T;
	}
	if(S != n-1) {puts("-1"); return 0;}
	solve(p1);
	reverse(a.begin(), a.end());
	solve(p2);
	bool F = false;
	for(int i=0;i<n;i++) {
		if(p1[i] > p2[i]) {F = true; break;}
		if(p1[i] < p2[i]) break;
	}
	if(F) swap(p1,p2);
	for(int i=0;i<n;i++) {
		printf("%d ",p1[i]);
	}
	puts("");
}
