#include<iostream>
#include<cstdio>

#define LL long long

using namespace std;

const int maxn = 1000000 + 10;

int n;
int x0;
int y0;
int xt;
int yt;

int dx[maxn];
int dy[maxn];
int fx;
int fy;

int ans = 0;

inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	n=read();
	x0=read();
	y0=read();
	xt=read();
	yt=read();
	for(int i=1;i<=n;i++)
	{
		dx[i]=read();
		dy[i]=read();
		fx = x0;
		fy = y0;
	}
	for(int i=1;i<=n;i++)
	{
		fx += dx[i];
		fy += dy[i];
		if(fx==xt&&fy==yt)
		{
			ans = i;
			cout<<ans;
		}
	}
	if(ans==0)
	{
		cout<<"SingleDogMZX";
	}
	return 0;
}
/*
3 1 1 5 4
1 1
1 1
1 1
*/
/*
5 1 1 3 2
1 1
0 -2
0 2
1 0
0 -1
*/
/*
5 1 1 3 2
1 2
0 -3
0 2
1 0
0 -1
*/