#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <cmath>
#include <ctime>
using namespace std;
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (ch>'9'||ch<'0')	{if (ch=='-'){f=-1;} ch=getchar();}
	while (ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
int n,nowx,nowy,aimx,aimy,tx,ty;
bool f[5010][5010]={};
int ans=1;
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	memset(f,false,sizeofs(f));
	n=read();nowx=read();nowy=read();aimx=read();aimy=read();
	nowx+=2500;nowy+=2500;aimx+=2500;aimy+=2500;
	f[nowx][nowy]=true;
	for (int i=1;i<=n;i++){
		tx=read();	nowx+=tx;
		ty=read();	nowy+=ty;
		if (!f[nowx][nowy])	
			{f[nowx][nowy]=true;ans++;}
		if (nowx==aimx&&nowy==aimy)	
			{cout<<ans<<endl;return 0;}
	}
	cout<<"SingleDogMZX"<<endl;
	
	return 0;
}