var  n,m,j,k,l,i,b,c,x,y,x1,y1,o,p:longint;
     map:array[-2600..2600,-2600..2600] of boolean;
     dx,dy:array[1..1000000] of longint;
begin
  assign(input,'lovefinding.in');
  assign(output,'lovefinding.out');
  rewrite(output);
  reset(input);
  readln(n,x,y,x1,y1);
  o:=0;
  for i:=1 to n do
  begin
    readln(b,c);
    dx[i]:=b;
    dy[i]:=c;
  end;
  map[x,y]:=true;
  if (x=x1)and(y=y1) then
  begin
    writeln(1);
    close(input);
    close(output);
    halt;
  end;
  o:=1;
  for i:=1 to n do
  begin
  x:=x+dx[i];
  y:=y+dy[i];
  if map[x,y]=false then
     begin
       inc(o);
       map[x,y]:=true;
     end;
  if (y=y1)and(x=x1) then break;
  end;
  writeln(o);
  close(input);
  close(output);
end.