#include<stdio.h>
#include<string.h>
typedef struct node
{
	int x;
	int y;
}pp;
pp biao[1000003];
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	int n,x0,y0,xt,yt,i,p,book[5002][5002];
		memset(book,-1,sizeof(book));
	scanf("%d %d %d %d %d",&n,&x0,&y0,&xt,&yt);
	biao[0].x=x0;
	biao[0].y=y0;
	p=1;
	book[biao[0].x+2500][biao[0].y+2500]=1;
	for(i=1;i<=n;i++)
		scanf("%d %d",&biao[i].x,&biao[i].y);
	for(i=1;i<=n;i++)
	{
		if(biao[0].x==xt&&biao[0].y==yt)
		{
			printf("%d",p);
			break;
		}
		else
		{
	
			
			biao[0].x+=biao[i].x;
			biao[0].y+=biao[i].y;
			if(book[biao[0].x+2500][biao[0].y+2500]!=1)
			p++;
			
			book[biao[0].x+2500][biao[0].y+2500]=1;;
		}
		if(i==n&&(biao[0].x!=xt||biao[0].y!=yt))
			printf("SingleDogMZX");
	}
	return 0;
}