Problem: During the lunch break all n Berland State University students lined up in the food court. However, it turned out that the food court, too, has a lunch break and it temporarily stopped working.

Standing in a queue that isn't being served is so boring! So, each of the students wrote down the number of the student ID of the student that stands in line directly in front of him, and the student that stands in line directly behind him. If no one stands before or after a student (that is, he is the first one or the last one), then he writes down number 0 instead (in Berland State University student IDs are numerated from 1).

After that, all the students went about their business. When they returned, they found out that restoring the queue is not such an easy task.

Help the students to restore the state of the queue by the numbers of the student ID's of their neighbors in the queue.

Input

The first line contains integer n (2 ≤ n ≤ 2·105) — the number of students in the queue. 

Then n lines follow, i-th line contains the pair of integers ai, bi (0 ≤ ai, bi ≤ 106), where ai is the ID number of a person in front of a student and bi is the ID number of a person behind a student. The lines are given in the arbitrary order. Value 0 is given instead of a neighbor's ID number if the neighbor doesn't exist.

The ID numbers of all students are distinct. It is guaranteed that the records correspond too the queue where all the students stand in some order.

Output

Print a sequence of n integers x1, x2, ..., xn — the sequence of ID numbers of all the students in the order they go in the queue from the first student to the last one.

Examples

Input

4
92 31
0 7
31 0
7 141


Output

92 7 31 141 

Note

The picture illustrates the queue for the first sample.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const double eps = 1e-6;
const int MAXN = 2e5 + 10;
const int MOD = 1000007;
struct POINT {
  int pre, next;
  bool operator<(const POINT &a) const { return pre < a.pre; }
} pit[MAXN];
int ans[MAXN], in[MAXN], out[MAXN], n;
map<int, int> inMap, outMap;
int Solve(int val) {
  int l = 0, r = n, mid;
  while (l < r) {
    mid = (l + ((r - l) >> 1));
    if (pit[mid].pre == val) return mid;
    if (pit[mid].pre < val)
      l = mid + 1;
    else
      r = mid;
  }
  return -1;
}
int main() {
  int i, j;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int a, b;
    scanf("%d%d", &pit[i].pre, &pit[i].next);
    inMap[pit[i].pre]++, outMap[pit[i].next]++;
  }
  sort(pit, pit + n);
  int pos = 2;
  int curPeo = pit[0].next, lstPeo = curPeo;
  while (curPeo != 0) {
    ans[pos] = curPeo;
    lstPeo = curPeo;
    pos += 2;
    int tmpPos = Solve(curPeo);
    if (tmpPos == -1) break;
    curPeo = pit[tmpPos].next;
  }
  pos = 1;
  int bakPeo;
  for (i = 1; i <= n; i++) {
    if (inMap[pit[i].pre] == 1 && outMap[pit[i].pre] == 0) {
      curPeo = pit[i].pre;
      break;
    }
  }
  ans[pos] = curPeo;
  curPeo = pit[i].next;
  pos += 2;
  while (curPeo != 0) {
    ans[pos] = curPeo;
    pos += 2;
    int tmpPos = Solve(curPeo);
    if (tmpPos == -1) break;
    curPeo = pit[tmpPos].next;
  }
  for (i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}