#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=110;
int Map[maxn][maxn];
bool vis[maxn];
int ans[maxn];
int main()
{
int n,i,j,k;
while(scanf("%d",&n)!=EOF){
memset(vis,false,sizeof(vis));
int cnt=0;
for(i=1;i<=n;++i){
bool good=true;
for(j=1;j<=n;++j){
scanf("%d",&Map[i][j]);
if(Map[i][j]==1||Map[i][j]==3){
good=false;
}
}
if(good){
ans[cnt++]=i;
}
}
printf("%d\n",cnt);
for(i=0;i<cnt;++i){
if(i){
printf(" %d",ans[i]);
}
else {
printf("%d",ans[i]);
}
}
printf("\n");
}
return 0;
}
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=100010;
char s[maxn];
char t[maxn];
char ans[maxn];
int main()
{
int n,m,i,j,k;
while(scanf("%s%s",s,t)!=EOF){
int l=strlen(s);
int num=0;
for(i=0;i<l;++i){
if(s[i]!=t[i])num++;
}
if(num&1){
printf("impossible\n");
}
else {
int num1=0;
for(i=0;i<l;++i){
if(s[i]==t[i]){
ans[i]=s[i];
}
else if(num1<num/2){
num1++;
ans[i]=s[i];
}
else {
ans[i]=t[i];
}
}
ans[l]=0;
printf("%s\n",ans);
}
}
return 0;
}
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
#include<cstring>
using namespace std;
const int maxn=100010;
struct Node{
long long pos,h;
}A[maxn];
bool cmp(Node a,Node b){
return a.pos<b.pos;
}
int main()
{
int n,i,j,k;
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%lld%lld",&A[i].pos,&A[i].h);
}
if(n<3){
printf("%d\n",n);
return 0;
}
sort(A+1,A+n+1,cmp);
long long left=A[1].pos,ans=2;
for(i=2;i<n;++i){
if(A[i].pos-A[i].h>left){
left=A[i].pos;ans++;
}
else {
if(A[i].pos+A[i].h<A[i+1].pos){
ans++;left=A[i].pos+A[i].h;
}
else left=A[i].pos;
}
}
printf("%lld\n",ans);
return 0;
}
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<list>
#include<vector>
using namespace std;
const int maxn=100010;
long long num[maxn];
int main()
{
int n,i,j,k;
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%lld",&num[i]);
}
sort(num+1,num+n+1);
long long time=num[1],ans=1;
for(i=2;i<=n;++i){
if(time<=num[i]){
time+=num[i];
ans++;
}
}
printf("%lld\n",ans);
return 0;
}