#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int type;
    long int m, i, j = 0;
    long long int *req, *c;

    set <long long int> el;

    cin >> m;
    m *= 2;

    req = new long long int[m];

    for (i = 0; i < m; i += 2)
    {
        cin >> req[i] >> req[i + 1];

        if (req[i] == 1) el.insert(req[i + 1]);
    }

    c = new long int[el.size()]

    for (i = 0; i < m; i += 2)
    {
        if (req[i] == 1)
        {
            long long int curEl;

            curEl = req[i + 1];

            c[j] = 1;
        }
    }

    for (i = 0; i < a.size(); i++)
        cout << a[i] << " ";
    cout << endl;

    return 0;
}