#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<map>
#include<set>
using namespace std;
char buf[100*1024*1024];
int len;
long long th=0;
inline void QR(int& x){
	char ch;bool f=0;
	while(ch=buf[th++],(ch<'0'||ch>'9')&&ch!='-');
	if(ch=='-'){ch=buf[th++];f=1;}x=ch-48;
	while(ch=buf[th++],ch>='0'&&ch<='9')x=x*10+ch-48;
	if(f)x=-x;
}
struct node{
	int x,y;
	inline node(const int& a=0,const int& b=0){
		x=a;y=b;
	}
	inline void input(){QR(x);QR(y);}
	bool operator<(const node& s)const{return x<s.x||(x==s.x&&y<s.y);}
	bool operator==(const node& s)const{return x==s.x&&y==s.y;}
	node operator+(const node& s)const{return node(x+s.x,y+s.y);}
	friend void operator +=(node& a,const node& b){a=a+b;}
};set<node>se;
int main(){
	#define submit
	#ifdef submit
	freopen("loverfinding.in","r",stdin);
	len=fread(buf,1,100*1024*1024,stdin);
	buf[len]='\0';
	freopen("loverfinding.out","w",stdout);
	#endif
	int n,ans=1;node s,t,tmp;
	QR(n);s.input();t.input();
	se.insert(s);
	if(s==t)n=0;
	for(int i=1;i<=n;++i){
		tmp.input();
		s+=tmp;
		if(!se.count(s)){
			++ans;
			se.insert(s);
		}
		if(s==t){printf("%d\n",ans);goto END;}
	}
	puts("SingleDogMZX");
	END:;
	#ifdef submit
	fclose(stdin);
	fclose(stdout);
	#else
	system("pause");
	#endif
	return 0;
}