#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 6000;
const int BIT = 3000;
bool Flag[maxn][maxn] = {0};
typedef long long LL;
LL N,lx,ly,tx,rx,ry,ans = 0;
int main(){
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	scanf("%lld%lld%lld%lld%lld",&N,&lx,&ly,&rx,&ry);
	ans++ ;
	if(lx == rx&&ly == ry){
		printf("1");
		return 0;	
	}
	Flag[lx+BIT][ly+BIT] = true;
	LL a,b;
	for(int i = 1;i<=N;i++){
		scanf("%lld%lld",&a,&b);
		lx+=a;
		ly+=b;
		if(!Flag[lx+BIT][ly+BIT])ans++,Flag[lx+BIT][ly+BIT] = true;
		if(lx == rx&&ly == ry){
			printf("%lld",ans);
			return 0;	
		}
	}
	printf("SingleDogMZX\n");
	return 0;
}