491 {
492 int n;
493 while(cin >> n) {
494 if(n == -1)
495 return 0;
496 vector<vector<int>> siblings = vector(n, vector<int>());
497 vector<vector<bool>> graph = vector(n, vector<bool>(n, false));
498 for(int i = 0; i < n; i++) {
499 for(int j = 0; j < n; j++) {
500 int x;
501 cin >> x;
502 if(x == 1) {
503 siblings[i].push_back(j);
504
505 graph[i][j] = true;
506 graph[j][i] = true;
507 }
508 }
509 }
510 for(
int i = 0; i <
n; i++) {
511 bool flag = true;
512 for(int j = 0; j < siblings[i].size(); j++) {
513 for(int k = j + 1; k < siblings[i].size(); k++) {
514 if(graph[siblings[i][j]][siblings[i][k]]) {
515 flag = false;
516 break;
517 }
518 }
519 if(!flag) {
520 break;
521 }
522 }
523 if(flag) {
524 cout << i << ' ';
525 }
526 }
527 cout << endl;
528 }
529
530 return 0;
531 }