|Codeforces Round #303 (Div. 2)|
Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The process of a tournament is described in the next paragraph.
There are n toy cars. Each pair collides. The result of a collision can be one of the following: no car turned over, one car turned over, both cars turned over. A car is good if it turned over in no collision. The results of the collisions are determined by an n × n matrix А: there is a number on the intersection of the і-th row and j-th column that describes the result of the collision of the і-th and the j-th car:
Susie wants to find all the good cars. She quickly determined which cars are good. Can you cope with the task?
The first line contains integer n (1 ≤ n ≤ 100) — the number of cars.
Each of the next n lines contains n space-separated integers that determine matrix A.
It is guaranteed that on the main diagonal there are - 1, and - 1 doesn't appear anywhere else in the matrix.
It is guaranteed that the input is correct, that is, if A ij = 1, then A ji = 2, if A ij = 3, then A ji = 3, and if A ij = 0, then A ji = 0.
Print the number of good cars and in the next line print their space-separated indices in the increasing order.
-1 0 0
0 -1 1
0 2 -1
-1 3 3 3
3 -1 3 3
3 3 -1 3
3 3 3 -1