#include<iostream> 
#include<cstdio>
#include<algorithm>
#define base 1000000000
#define maxn 1000010
#define ll long long
using namespace std;
ll n,sx,sy,ex,ey,a[maxn],cnt,ans;
bool falg;
ll init(){
	ll x=0,f=1;char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
	return x*f;
}
ll Cal(ll x,ll y){
	return x*base+y;
}
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	n=init();sx=init();sy=init();ex=init();ey=init();
	sx+=base;sy+=base;ex+=base;ey+=base;ll x,y;
	a[++cnt]=Cal(sx,sy);
	for(int i=1;i<=n;i++){
		x=init();y=init();
		sx+=x;sy+=y;
		a[++cnt]=Cal(sx,sy);
		if(sx==ex&&sy==ey){
			falg=1;break;
		}
	}
	if(!falg){
		printf("SingleDogMZX\n");
		return 0;
	}
	sort(a+1,a+1+cnt);
	ans=unique(a+1,a+1+cnt)-a-1;
	cout<<ans<<endl;
	return 0;
}