#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n,a[2510][2510]={},sum=0,maxx=0,yu=0;
int x1,y11,xn,yn1;
int main()
{
	freopen("loverfinding.in","r",stdin);
	freopen("loverfinding.out","w",stdout);
	cin>>n>>x1>>y11>>xn>>yn1;
	a[x1][y11]=1;
	for(int i=1;i<=n;i++)
	{
		int xx,yy;
		cin>>xx>>yy;
		if(yu==1)
			continue;
		if(x1==xn&&y11==yn1)
		{
			maxx=sum;
			yu=1;
		}
		if(a[x1+xx][y11+yy]==0)
		{
			sum++;
			a[x1+xx][y11+yy]=1;
		}
		x1+=xx;
		y11+=yy;
		if(i==n&&yu==0)
		{
			cout<<"SingleDogMZX"<<endl;
		}
	}
	if(yu==1)
		cout<<sum<<endl;
	return 0;
}