#include<cstdio>
#define FILE "loverfinding"

namespace IO{
	char buf[1<<15],*fs,*ft;
	inline char gc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
	inline int read(){
		int x=0,rev=0,ch=gc();
		while(ch<'0'||ch>'9'){if(ch=='-')rev=1;ch=gc();}
		while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=gc();}
		return rev?-x:x;
	}
}using namespace IO;

struct Point{
	int x,y;
	Point(){}
	Point(int a,int b):x(a),y(b){}
};
inline Point operator+(const Point& a,const Point& b){
	return Point(a.x+b.x,a.y+b.y);
}
inline bool operator!=(const Point& a,const Point& b){
	return a.x!=b.x||a.y!=b.y;
}
inline Point getp(){
	int x=read(),y=read();
	return Point(x,y);
}


namespace Hash_Table{
	const int HASH_SIZE(23333309),step(7);
	inline int h(const Point& p){
		int ans=(1LL*(p.x+int(1e9))*int(2e9+1)+p.y+int(1e9))%HASH_SIZE;
		if(ans<0)ans+=HASH_SIZE;
		return ans;
	}
	Point ht[HASH_SIZE];bool state[HASH_SIZE];int TOT;
	int hash(const Point& p){
		int at=h(p);
		for(;state[at]&&ht[at]!=p;TOT++)
			if((at+=step)>=HASH_SIZE)
				at-=HASH_SIZE;
		if(!state[at]){
			ht[at]=p;
			state[at]=true;
			return 0;
		}
		else return 1;
	}
}using namespace Hash_Table;

#include<ctime>
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	int n=read(),ans=1;Point now=getp(),t=getp();
	hash(t);
	if(!hash(now))ans++;
	else {printf("1\n");return 0;}
	bool flag=false;
	for(int i=1;i<=n;i++){
		now=now+getp();
		if(!(now!=t)){flag=true;break;}
		else if(!hash(now))
			ans++;
	}
	if(flag)printf("%d\n",ans);
	else printf("SingleDogMZX\n");
	return 0;
}