#include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
int n,nx,ny,sx,sy,ex,ey,flag;
struct node
{
	int x;
	int y;
	bool operator < (node a)const
	{
		if(x==a.x)return y<a.y;
		return x<a.x;
	}
};
set<node>s;
int init()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
	return x*f;
}
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	int i,j,k;
	n=init();sx=init();sy=init();ex=init();ey=init();
	nx=sx,ny=sy;
	for(i=1;i<=n+1;i++)
	{
		s.insert((node){nx,ny});
		if(nx==ex&&ny==ey){flag=1;break;}
		if(i==n+1)break;
		int tx,ty;
		tx=init();ty=init();
		nx+=tx;ny+=ty;
	}
	if(!flag)
	{
		printf("SingleDogMZX\n");
		return 0;
	}
	int sum=s.size();
	printf("%d\n",sum);
	return 0;
}