#include <stdio.h>
int i,j,m,n,k,x1,x2,x3,x4,x5,x6,p,q;
int a[2][1000001];
int main()
{
freopen("loverfinding.in","r",stdin);
freopen("loverfinding.out","w",stdout);
scanf("%d%d%d%d%d",&n,&x1,&x2,&x3,&x4);
k=1;
a[0][0]=x1;
a[1][0]=x2;
if(n==0)
if( (x1==x3)&&(x2==x4))
{	
printf("1");
return;
}
for(i=1;i<=n;i++)
{
x5=0;
x6=0;
scanf("%d%d",&p,&q);
a[0][i]=p;
a[1][i]=q;
x1=x1+p;
x2=x2+q;

for(j=i;j>=0;j--)
{
	x5=x5+a[0][j];
	x6=x6+a[1][j];
if(  (x5==0)&&(x6==0)    )
	break;
if(j==0)
k++;	
}	


if( (x1==x3)&&(x2==x4)  )
{
	printf("%d",k);
	return;
}
}
if(i>=n)
printf("SingleDogMZX");

	

return 0;
}