#include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
typedef long long ll;
const int maxn=5210,p=2510;
inline void in(ll &x){
    x=0;int f=1;char t=getchar();
    while(!isdigit(t)){if(t=='-')f=-1;t=getchar();}
    while(isdigit(t)){x=x*10+t-48;t=getchar();}
    x*=f;
}
ll n,x0,y0,xt,yt,ans=0;
ll x,y;
bool g[maxn][maxn];
int work(){
	in(n);
	in(x0);in(y0);x0+=p;y0+=p;g[x0][y0]=1;
	in(xt);in(yt);xt+=p;yt+=p;
	for(int i=1;i<=n;i++){
		in(x);in(y);
		x0+=x;y0+=y;
		if(!g[x0][y0]){
			g[x0][y0]=1;
			ans++;
			if(x0==xt&&y0==yt){
				printf("%d",ans+1);
				return 0;
			}
		}
	}
	printf("SingleDogMZX");
	return 0;
}
int main(){
	freopen("loverfinding.in", "r", stdin);
    freopen("loverfinding.out", "w", stdout);
    work();
}