#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
//           dx[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(10);
  }
} iosetup;
/*-------------------------------------------------*/
int main() {
  int n; cin >> n;
  map<string, int> mp;
  vector<int> cnt;
  while (n--) {
    string a, b; cin >> a >> b;
    if (mp.count(a) == 0) {
      int sz = mp.size();
      mp[a] = sz;
      cnt.emplace_back(0);
    }
    if (mp.count(b) == 0) {
      int sz = mp.size();
      mp[b] = sz;
      cnt.emplace_back(0);
    }
    ++cnt[mp[a]];
  }
  vector<pair<int, string> > ans;
  for (auto it = mp.begin(); it != mp.end(); ++it) {
    if (cnt[(*it).second] == 0) ans.emplace_back((*it).second, (*it).first);
  }
  sort(ALL(ans));
  for (auto &pr : ans) cout << pr.second << '\n';
  return 0;
}