#include<cmath>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<map>
#define LL long long
#define Inf 0x7f7f7f7f
#define Begin freopen("loverfinding.in","r",stdin);freopen("loverfinding.out","w",stdout);
#define End fclose(stdin);fclose(stdout);
using namespace std;
const int mod1=2599;
const int mod2=3169;
const int mod3=2763;
const int mod4=2999;
const int maxn=4000;
bool vis[maxn][maxn][5];
int n,bx,by,ex,ey;
void Init();
void Update(int x,int y){
	int a,b;
	a=x,b=y;a%=mod1;b%=mod1;if(a<0)a+=mod1;if(b<0)b+=mod1;
	vis[a%mod1][b%mod1][0]=1;
	a=x,b=y;a%=mod2;b%=mod2;if(a<0)a+=mod2;if(b<0)b+=mod2;
	vis[a%mod2][b%mod2][1]=1;
	a=x,b=y;a%=mod3;b%=mod3;if(a<0)a+=mod3;if(b<0)b+=mod3;
	vis[a%mod3][b%mod3][2]=1;
	a=x,b=y;a%=mod4;b%=mod4;if(a<0)a+=mod4;if(b<0)b+=mod4;
	vis[a%mod4][b%mod4][3]=1;
}
bool Judge(int x,int y){
	int a,b;
	a=x,b=y;a%=mod1;b%=mod1;if(a<0)a+=mod1;if(b<0)b+=mod1;
	if(vis[a%mod1][b%mod1][0]==0)return false;
	a=x,b=y;a%=mod2;b%=mod2;if(a<0)a+=mod2;if(b<0)b+=mod2;
	if(vis[a%mod2][b%mod2][1]==0)return false;
	a=x,b=y;a%=mod3;b%=mod3;if(a<0)a+=mod3;if(b<0)b+=mod3;
	if(vis[a%mod3][b%mod3][2]==0)return false;
	a=x,b=y;a%=mod4;b%=mod4;if(a<0)a+=mod4;if(b<0)b+=mod4;
	if(vis[a%mod4][b%mod4][3]==0)return false;
	return true;
}
int main(){
    Begin;
    Init();
    //system("pause");
    End;
    return 0;
}
void Init(){
	scanf("%d%d%d%d%d",&n,&bx,&by,&ex,&ey);
	int ans=1;
	Update(bx,by);
	if(bx==ex && by==ey){puts("1");return;}
	for(int i=1;i<=n;i++){
		int x,y;scanf("%d%d",&x,&y);
		bx+=x;by+=y;
		if(!Judge(bx,by)){ans++;Update(bx,by);}
		if(bx==ex && by==ey){printf("%d\n",ans);return;}
	}
	printf("SingleDogMZX\n");
	//printf("%.2lf\n",(double)clock()/CLOCKS_PER_SEC);
}