#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<algorithm>
#ifdef WIN32
#define LD "%I64d"
#else
#define LD "%lld"
#endif
struct node{
	int x,y;
	bool friend operator <(const node &a,const node &b){
		if(a.x==b.x)return a.y<b.y;
		return a.x<b.x;
	}
};
std::set<node> se;
int i,n,x,y,a,b,s,t,ans=1;
char c;
inline void read(int &a){
	for(c=getchar(),a=0;(c<'0'||c>'9')&&c!='-';c=getchar());
	int f=1;
	if(c=='-')f=-1,c=getchar();
	for(;c>='0'&&c<='9';c=getchar())a=(a<<1)+(a<<3)+c-'0';
	a*=f;
}
int main(){
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	read(n),read(a),read(b),read(s),read(t);
	if(a==s&&t==b){
		puts("1");
		return 0;
	}
	se.insert((node){a,b});
	for(i=1;i<=n;i++){
		read(x),read(y);
		a+=x,b+=y;
		if(se.find((node){a,b})==se.end()){
			ans++;
			if(a==s&&t==b){
				printf("%d",ans);
				return 0;
			}
			se.insert((node){a,b});
		}
	}
	puts("SingleDogMZX");
	return 0;
}