Young jedi Ivan has infiltrated in The Death Star and his task is to destroy it. In order to destroy The Death Star, he needs an array of non-negative integers of length that represents the code for initiating the self-destruction of The Death Star. Ivan doesn't have the array, but he has a piece of paper with requirements for that array, given to him by his good old friend Darth Vader.

On the paper, a square matrix of the size is written down. In that matrix in the row and
column there is a number that is equal to **bitwise and** between numbers and . Unfortunately, a
lightsaber has destroyed all the fields on the matrix's main diagonal and Ivan cannot read what is on
these fields. Help Ivan to reconstruct an array for the self-destruction of The Death Star that meets
the requirements of the matrix.

The solution doesn't need to be unique, but will always **exist.**

#### Input

The first line of input contains the integer , size of the matrix.

Each of the following lines contains numbers , the elements of the matrix.

#### Output

The first and only line of output must contain any array of non-negative integers less than that meet the requirements from the task.

#### Sample Input 1

```
3
0 1 1
1 0 1
1 1 0
```

#### Sample Output 1

`1 1 1`

#### Explanation for Sample Output 1

It is clear that one of the arrays that meets the requirements from the matrix is . Notice that this is not the only possible solution.

#### Sample Input 2

```
5
0 0 1 1 1
0 0 2 0 2
1 2 0 1 3
1 0 1 0 1
1 2 3 1 0
```

#### Sample Output 2

`1 2 3 1 11`

## Comments

This case seems to break some unintended solutions. Can anyone verify?