Problem: The board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles.

Each node of the graph is painted black or white in such a manner that there aren't two nodes of the same color, connected by an edge. Each edge contains its value written on it as a non-negative integer.

A bad boy Vasya came up to the board and wrote number sv near each node v — the sum of values of all edges that are incident to this node. Then Vasya removed the edges and their values from the board.

Your task is to restore the original tree by the node colors and numbers sv.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 105) — the number of nodes in the tree. Next n lines contain pairs of space-separated integers ci, si (0 ≤ ci ≤ 1, 0 ≤ si ≤ 109), where ci stands for the color of the i-th vertex (0 is for white, 1 is for black), and si represents the sum of values of the edges that are incident to the i-th vertex of the tree that is painted on the board.

Output

Print the description of n - 1 edges of the tree graph. Each description is a group of three integers vi, ui, wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ wi ≤ 109), where vi and ui — are the numbers of the nodes that are connected by the i-th edge, and wi is its value. Note that the following condition must fulfill cvi ≠ cui.

It is guaranteed that for any input data there exists at least one graph that meets these data. If there are multiple solutions, print any of them. You are allowed to print the edges in any order. As you print the numbers, separate them with spaces.

Examples

Input

3
1 3
1 2
0 5


Output

3 1 3
3 2 2


Input

6
1 0
0 3
1 8
0 2
0 3
0 0


Output

2 3 3
5 3 3
4 3 2
1 6 0
2 1 0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
class N {
 public:
  long id, value;
  N(long _id, long _value);
};
N::N(long _id, long _value) {
  id = _id;
  value = _value;
}
class H {
 private:
  vector<N> elem;
  void swap(long a, long b);

 public:
  bool empty();
  H();
  void modify(long value);
  void pop();
  N top();
  void push(long id, long value);
} B, W;
void H::modify(long value) {
  if (value == 0) {
    pop();
    return;
  }
  elem[1].value = value;
}
bool H::empty() {
  if (elem.size() <= 1) return true;
  return false;
}
N H::top() { return elem[1]; }
void H::pop() {
  elem[1] = elem.back();
  elem.pop_back();
  bool finished;
  long maxChild;
  long n = 1;
  do {
    finished = true;
    if (2 * n >= elem.size()) return;
    if (2 * n + 1 >= elem.size()) maxChild = 2 * n;
    if (2 * n + 1 < elem.size())
      maxChild = elem[2 * n].value > elem[2 * n + 1].value ? 2 * n : 2 * n + 1;
    if (elem[n].value < elem[maxChild].value) {
      swap(n, maxChild);
      n = maxChild;
      finished = false;
    }
  } while (!finished);
}
void H::swap(long a, long b) {
  long t_id = elem[a].id;
  long t_value = elem[a].value;
  elem[a].id = elem[b].id;
  elem[a].value = elem[b].value;
  elem[b].id = t_id;
  elem[b].value = t_value;
}
H::H() { elem.push_back(N(0, 2000000000)); }
void H::push(long id, long value) {
  elem.push_back(N(id, value));
  long n = elem.size() - 1;
  while (elem[n].value > elem[n / 2].value) {
    swap(n, n / 2);
    n /= 2;
  }
}
int Color[100005];
long N;
vector<long> Child[100005];
void in() {
  scanf("%ld", &N);
  long value;
  for (long i = 1; i <= N; i++) {
    scanf("%d %ld", &Color[i], &value);
    if (Color[i] == 0)
      B.push(i, value);
    else
      W.push(i, value);
  }
}
void makeConnected() {
  bool visited[100005];
  long v = 1;
  for (long i = 0; i < 100005; i++) visited[i] = false;
  long n;
  queue<long> q;
  visited[1] = true;
  q.push(1);
  while (v < N) {
    if (q.empty()) {
      for (long i = 1; i <= N; i++)
        if (!visited[i]) {
          for (long j = 1; j <= N; j++)
            if (visited[j] && Color[i] != Color[j]) {
              printf("%ld %ld 0\n", i, j);
              visited[i] = true;
              v++;
              Child[i].push_back(j);
              Child[j].push_back(i);
              q.push(i);
              i = j = N + 1;
            }
        }
    }
    n = q.front();
    q.pop();
    for (long i = 0; i < Child[n].size(); i++)
      if (!visited[Child[n][i]]) {
        visited[Child[n][i]] = true;
        v++;
        q.push(Child[n][i]);
      }
  }
}
void solve() {
  while (!B.empty() && !W.empty()) {
    long value =
        (B.top().value < W.top().value ? B.top().value : W.top().value);
    printf("%ld %ld %ld\n", B.top().id, W.top().id, value);
    Child[B.top().id].push_back(W.top().id);
    Child[W.top().id].push_back(B.top().id);
    B.modify(B.top().value - value);
    W.modify(W.top().value - value);
  }
  makeConnected();
}
int main() {
  in();
  solve();
  return 0;
}