CF275A.Lights Out

Lenny is playing a game on a 3 × 3 grid of lights. In the beginning of the game all lights are switched on. Pressing any of the lights will toggle it and all side-adjacent lights. The goal of the game is to switch all the lights off. We consider the toggling as follows: if the light was switched on then it will be switched off, if it was switched off then it will be switched on.

Lenny has spent some time playing with the grid and by now he has pressed each light a certain number of times. Given the number of times each light is pressed, you have to print the current state of each light.

伦尼正在玩一个 3 × 3 的灯格游戏。游戏开始时，所有灯均处于开启状态。按下任意一盏灯会切换它自身以及所有与其边相邻（即上下左右）的灯的状态。游戏的目标是将所有灯都关闭。我们定义“切换”操作如下：若灯当前为开启状态，则将其关闭；若灯当前为关闭状态，则将其开启。

伦尼已花了一些时间操作该灯格，目前他已对每盏灯按下了若干次。给定每盏灯被按下的次数，你需要输出每盏灯当前的状态。

The input consists of three rows. Each row contains three integers each between 0 to 100 inclusive. The j-th number in the i-th row is the number of times the j-th light of the i-th row of the grid is pressed.

输入包含三行。每行包含三个整数，每个整数的取值范围为 $0$ 到 $100$（含端点）。第 $i$ 行中的第 $j$ 个数字表示网格中第 $i$ 行第 $j$ 个灯被按下的次数。

Print three lines, each containing three characters. The j-th character of the i-th line is "1" if and only if the corresponding light is switched on, otherwise it's "0".

输出三行，每行包含三个字符。第 $i$ 行的第 $j$ 个字符为 "1" 当且仅当对应的灯处于开启状态，否则为 "0"。