#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
int n,x,y,tx,ty,dx,dy;
set<pair<int,int> >a;
int main(){
#define MINE
#ifdef MINE
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
#endif
	scanf("%d%d%d%d%d",&n,&x,&y,&tx,&ty);
	a.insert(make_pair(x,y));
	while(n--){
		scanf("%d%d",&dx,&dy);
		x+=dx;y+=dy;
		a.insert(make_pair(x,y));
		if(x==tx&&y==ty)break;
	}
	if(a.count(make_pair(tx,ty)))printf("%d",a.size());
	else printf("SingleDogMZX");
#ifndef MINE
	printf("\n-------------------------DONE-------------------------\n");
	for(;;);
#endif
	return 0;
}