#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define mod 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

int main(){
    int n;
    cin >> n;
    set<string> st;
    vector<string> p;
    rep(i,n){
        string a,b;
        cin >> a >> b;
        st.insert(a);
        p.push_back(b);
    }   
    set<string> used;
    rep(i,n){
        if(st.count(p[i])==0){
            if(used.count(p[i])==0){
                used.insert(p[i]);
                cout << p[i] << endl;
            }
        }
    }
    
    return 0;
}