#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const double PI = acos(-1);
const ll MOD = 1000000007;
using Graph = vector<vector<int>>;

int main() {
  int N; cin >> N;
  vector<string> A(N),B(N);
  unordered_set<string> s;
  rep(i,N) cin >> A[i] >> B[i];

  rep(i,N) s.insert(A[i]);
  rep(i,N) {
    if (!s.count(B[i])) {
      cout << B[i] << endl;
      s.insert(B[i]);
    }
  }
}