跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1670. Toy Cars

  • ID: 1676
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Toy Cars

题目描述

A. Toy Cars
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 A: there is a number on the intersection of the i-th row and j-th column that describes the result of the collision of the i-th and the j-th car:

  • -1: if this pair of cars never collided. -1 occurs only on the main diagonal of the matrix.
  • 0: if no car turned over during the collision.
  • 1: if only the i-th car turned over during the collision.
  • 2: if only the j-th car turned over during the collision.
  • 3: if both cars turned over during the collision.

Susie wants to find all the good cars. She quickly determined which cars are good. Can you cope with the task?

Input

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 Aij=1, then Aji=2, if Aij=3, then Aji=3, and if Aij=0, then Aji=0.

Output

Print the number of good cars and in the next line print their space-separated indices in the increasing order.

Examples
Input
3
-1 0 0
0 -1 1
0 2 -1
Output
2
1 3
Input
4
-1 3 3 3
3 -1 3 3
3 3 -1 3
3 3 3 -1
Output
0

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1202 题。保留原作者与原赛事署名。