/** * code generated by JHelper * More info: https://github.com/AlexeyDmitriev/JHelper * @author aajisaka */ #include using namespace std; void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif #define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr) #define rep(i,n) for(int i=0; i<(int)(n); i++) #define all(v) v.begin(), v.end() template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } using ll = long long; using P = pair; constexpr double PI = 3.14159265358979323846; mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count()); class A { public: void solve(istream& cin, ostream& cout) { SPEED; int n; cin >> n; vector a(n), b(n); rep(i, n) { cin >> a[i] >> b[i]; } set cheated; rep(i, n) { cheated.insert(a[i]); } for(const auto e: b) { if (cheated.find(e) == cheated.end()) { cout << e << '\n'; cheated.insert(e); } } } }; signed main() { A solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; }