#include<cstdlib>
using namespace std;
const int N=7;
int n=7,m;
int comp_double(const void*a,const void *b)//两数相减，快排
{
return *(int *)a-*(int *)b;
}
void init()
{
int i,j,k,i1,i2;
int a[N],b[i],min[N],sum[N];
char max[N];
for(i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
printf("\r");
}
for(i=1;i<=n;i++)
{
sum[i]=a[i]+b[i];
}
for(i=1,i1=1,i2=1;i<=n,i1<=n,i2<=n;i++,i1++,i2++)
{
if(sum[i]<=8)
{min[i1]=sum[i];
sum[i]--;}
else
{
max[i2]=sum[i];
sum[i]--;
}
}
qsort(max,n,sizeof(float),comp_double);//调用快排库函数
if(i1==7)
cout<<0;
else
{ for(i2=1;i2<=n;)
{
if(max[i2]==sum[i2])
goto c;
else
i2++;
} c:cout<<i2;
}
}
int main()
{
init();
//while(1);
return 0;
}
readln(a,b);
l[i]:=a+b-8;
if l[i]>m then begin m:=l[i];z:=i;end;
end;