#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int x0,y0,xt,yt,n;
int ans;
int dx,dy;
bool a[5005][5005]={0};
inline int Main(){
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	scanf("%d%d%d%d%d",&n,&x0,&y0,&xt,&yt);
	a[x0][y0]=true;ans++;
	int x=x0,y=y0;
	for(int i=1;i<=n;i++){
		scanf("%d%d",&dx,&dy);
		if(a[x+dx][y+dy]==false){
		a[x+dx][y+dy]=true;
		ans++;
	}
		x=x+dx;y=y+dy;
		//cout<<x<<y<<ans;
		if(a[xt][yt]) {printf("%d",ans);return 0;}
		else continue;
	}
    printf("SingleDogMZX");
    fclose(stdin);
    fclose(stdout);
    return 0;
}
int work=Main();
int main(){;}