CF1103A.Grid game

You are given a 4x4 grid. You play a game — there is a sequence of tiles, each of them is either 2x1 or 1x2. Your task is to consequently place all tiles from the given sequence in the grid. When tile is placed, each cell which is located in fully occupied row or column is deleted (cells are deleted at the same time independently). You can place tile in the grid at any position, the only condition is that tiles (and tile parts) should not overlap. Your goal is to proceed all given figures and avoid crossing at any time.

你将得到一个 4×4 的网格。你需要进行一场游戏——给定一个由若干瓷砖组成的序列，每个瓷砖的尺寸为 2×1 或 1×2。你的任务是按顺序将序列中的所有瓷砖放置到该网格中。每当一个瓷砖被放置后，所有位于已完全填满的行或列中的格子都会被删除（这些格子的删除是同时且相互独立进行的）。你可以将瓷砖放置在网格中的任意位置，唯一的要求是：瓷砖（及其各部分）之间不能重叠。你的目标是成功放置所有给定的瓷砖，并在整个过程中始终避免发生重叠。

The only line contains a string $s$ consisting of zeroes and ones ($1 \le |s| \le 1000$). Zero describes vertical tile, one describes horizontal tile.

唯一的一行包含一个由 0 和 1 组成的字符串 $s$（$1 \le |s| \le 1000$）。0 表示竖直放置的瓷砖，1 表示水平放置的瓷砖。

Output $|s|$ lines — for each tile you should output two positive integers $r,c$, not exceeding $4$, representing numbers of smallest row and column intersecting with it.

If there exist multiple solutions, print any of them.

输出 $|s|$ 行——对每一块瓷砖，输出两个不超过 $4$ 的正整数 $r, c$，分别表示与其相交的最小行号和最小列号。

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

Following image illustrates the example after placing all three tiles:

Then the first row is deleted:

下图展示了放置全部三块方块后的示例：

随后，第一行被删除：