n=int(input())
l=[]
z=0
c=1
b=3
for i in range(n):
a=list(map(int,input().split()))
if (c not in a) and (b not in a):
z+=1
l.append(i+1)
print(z)
print(*(i for i in l))
//#include<brain>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll n,m,k,cnt;
struct node
{
bool b=1;
};
void anomalous_solve()
{
cin>>n;
ll a[n+1][n+1];
node b[n+1];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
if(a[i][j]==1)
{
b[i].b=0;
}
if(a[i][j]==2)
{
b[j].b=0;
}
if(a[i][j]==3)
{
b[i].b=0;
b[j].b=0;
}
}
}
vector<ll>ans;
for(int i=1;i<=n;i++)
{
if(b[i].b)
{
ans.push_back(i);
}
}
cout<<ans.size()<<"\n";
for(auto it:ans){
cout<<it<<" ";
}
}
int main()
{
// freopen("INPUT.txt","r",stdin);
// freopen("OUTPUT.txt","w",stdout);
ios_base::sync_with_stdio();
cin.tie(NULL);
cout.tie(NULL);
ll test=1;
//cin>>test;
for(int pos=1;pos<=test;pos++)
anomalous_solve();
}
1608B - Build the Permutation | 1505A - Is it rated - 2 |
169A - Chores | 765A - Neverending competitions |
1303A - Erasing Zeroes | 1005B - Delete from the Left |
94A - Restoring Password | 1529B - Sifid and Strange Subsequences |
1455C - Ping-pong | 1644C - Increase Subarray Sums |
1433A - Boring Apartments | 1428B - Belted Rooms |
519B - A and B and Compilation Errors | 1152B - Neko Performs Cat Furrier Transform |
1411A - In-game Chat | 119A - Epic Game |
703A - Mishka and Game | 1504C - Balance the Bits |
988A - Diverse Team | 1312B - Bogosort |
1616B - Mirror in the String | 1660C - Get an Even String |
489B - BerSU Ball | 977C - Less or Equal |
1505C - Fibonacci Words | 1660A - Vasya and Coins |
1660E - Matrix and Shifts | 1293B - JOE is on TV |
1584A - Mathematical Addition | 1660B - Vlad and Candies |