#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cstdlib>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
const int maxn=1000001;
int n;
int xs,ys,xt,yt;
int ans=1;
bool fx[maxn],fy[maxn];
struct node
{
	int x,y;
}a[maxn];

int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	//ios::sync_with_stdio(false);
	cin>>n>>xs>>ys>>xt>>yt;
	memset(fx,0,sizeof(fx));
	memset(fy,0,sizeof(fy));
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].x>>a[i].y;
	/*}
	for(int i=1;i<=n;i++)
	{*/
		xs=xs+a[i].x;
		ys=ys+a[i].y;
		if(xs==xt&&ys==yt)
		{
			ans++;
			cout<<ans<<endl;
			exit(0);
		}
		if(xs<0)
		{
			int k=xs+5000;
			if(ys>=0)
			{
				if((!fx[k])||(!fx[ys]))
				{
					fx[k]=1;
					fx[ys]=1;
					ans++;
				}
			}
			else if(ys<0)
			{
				int z=ys+5000;
				if((!fx[k])||(!fy[z]))
				{
					fx[k]=1;
					fy[z]=1;
					ans++;
				}
			}
		}
		if(xs>=0)
		{
			if(ys>=0)
			{
				if((!fx[xs])||(!fy[ys]))
				{
					fx[xs]=1;
					fy[ys]=1;
					ans++;
				}
			}
			else if(ys<0)
			{
				int z=ys+5000;
				if((!fx[xs])||(!fy[z]))
				{
					fx[xs]=1;
					fy[z]=1;
					ans++;
				}
			}
		}
	}
	cout<<"SingleDogMZX"<<endl;
	return 0;
}