#include<cstdio>
#include<iostream>
#include<set>
using namespace std;

const int maxn=1000000+10;
const int INF=0x3f3f3f3f;

int n, x0, y0, xt, yt;
set< pair<int, int> > v;

int Qin()
{
	int x=0, y=1;
	char c=getchar();
	if(c=='-') y=-1;
	while(c<'0' || c>'9') {
		c=getchar();
		if(c=='-') y=-1;
	}
	while(c>='0' && c<='9') x=x*10+c-'0', c=getchar();
	return x*y;
}

int main()
{
	freopen("loverfinding.in", "r", stdin);
	freopen("loverfinding.out", "w", stdout);
	n=Qin(); x0=Qin(); y0=Qin(); xt=Qin(); yt=Qin();
	v.insert(pair<int, int> (x0, y0));
	for(int i=1; i<=n; i++) {
		int x=Qin();
		int y=Qin();
		x0+=x; y0+=y;
		v.insert(pair<int, int> (x0, y0));
		if(x0==xt && y0==yt) {
			cout<<v.size(); return 0;
		}
	}
	printf("SingleDogMZX");
	return 0;
}