#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
#include <queue>
// #include "Src/Utility/BinarySearch.hpp"
// #include "Src/Sequence/CompressedSequence.hpp"
// #include "Src/Sequence/RunLengthEncoding.hpp"
// using namespace zawa;
// #include "atcoder/modint"
// using mint = atcoder::modint998244353;
int N, A[200020], B[200020], deg[200020];
std::vector<int> g[200020];
int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cin >> N;
    for (int i = 0 ; i < N ; i++) std::cin >> A[i] >> B[i];
    for (int i = 0 ; i + 1 < N ; i++) if (A[i] == 1) g[i + 1].push_back(i); 
    int last = N; 
    for (int i = N - 1 ; i >= 0 ; i--) {
        if (B[i] == 1) last = i;
        else if (B[i] == 2) {
            assert(last < N);
            g[last].push_back(i);
        }
    }
    for (int i = 0 ; i < N ; i++) for (int x : g[i]) deg[x]++;
    std::priority_queue<int, std::vector<int>, std::greater<int>> que;
    for (int i = 0 ; i < N ; i++) if (deg[i] == 0) que.push(i);
    for (int i = 0 ; i < N ; i++) {
        int v = que.top();
        que.pop();
        std::cout << v + 1 << '\n';
        for (int x : g[v]) {
            deg[x]--;
            if (deg[x] == 0) que.push(x);
        }
    }
}