CF739D.Recover a functional graph

Functional graph is a directed graph in which all vertices have outdegree equal to 1. Loops are allowed.

Some vertices of a functional graph lay on a cycle. From the others we can come to a cycle by making a finite number of steps along the edges (we consider only finite functional graphs in this problem).

Let's compute two values for each vertex. precycle__i is the amount of edges we should pass to get to a vertex which is a part of some cycle (zero, if i itself lies on a cycle), cycle__i is the length of the cycle we get to.

You are given the information about these values for some functional graph. For each vertex you know the values precycle__i and cycle__i, however, instead of some values there can be the question mark. It means that these values are unknown.

Build any functional graph that suits the description or determine that there is no such graph.

函数图（Functional graph）是一种有向图，其中每个顶点的出度均为 1（允许自环）。

在函数图中，某些顶点位于某个环上；其余顶点则可通过沿有向边走有限步到达某个环（本题中仅考虑有限函数图）。

对每个顶点 $i$，我们定义两个值：

• $\text{precycle}_i$ 表示从顶点 $i$ 出发、沿有向边行走，到达某个环上的顶点所需经过的边数（若 $i$ 本身就在环上，则 $\text{precycle}_i = 0$）；
• $\text{cycle}_i$ 表示从 $i$ 出发最终到达的那个环的长度。

现给出某函数图中各顶点对应的 $\text{precycle}_i$ 和 $\text{cycle}_i$ 值（部分值可能为问号 ?），即这些值未知。

请构造任意一个满足该描述的函数图；若不存在这样的函数图，则判定其不可能。

The first line contains single integer n (1 ≤ n ≤ 300) — the number of vertices in the graph.

Each of the next n lines contain two integers — precycle__i (0 ≤ precycle__i ≤ n - 1) and cycle__i (1 ≤ cycle__i ≤ n). There could be question marks instead of some of these values.

第一行包含一个整数 $n$（$1 \leq n \leq 300$）—— 图中顶点的数量。

接下来的 $n$ 行，每行包含两个整数：$\text{precycle}_i$（$0 \leq \text{precycle}_i \leq n-1$）和 $\text{cycle}_i$（$1 \leq \text{cycle}_i \leq n$）。这些值中某些可能被问号（?）代替。

In case there is no solution, print -1.

Otherwise, print n integers. i-th of them is the number of vertex to which the edge form the i-th vertex go.

The vertices should be in the same order as they go in input data.

If there are multiple solutions, print any of them.

若无解，请输出 -1。

否则，输出 n 个整数。其中第 i 个整数表示从第 i 个顶点出发的边所指向的顶点编号。

顶点的顺序应与输入数据中的顺序一致。

若存在多个解，输出任意一个即可。