区域内点的个数

import java.util.*;
class Point{
	int x;
	int y;
	public Point(int x,int y) {//
		this.x=x;
		this.y=y;
	}
	public boolean in(Point p1,Point p2) {
		boolean flag=false;
		if(x>p1.x&&x<p2.x&&y>p1.y&&y<p2.y) {
			flag=true;
		}
		return flag;
	}
}
public class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()) {
			int n=sc.nextInt();
			
			Point points[]=new Point[n];
			
			int x1=sc.nextInt();
			int y1=sc.nextInt();
			int x2=sc.nextInt();
			int y2=sc.nextInt();
			Point p1=new Point(x1,y1);
			Point p2=new Point(x2,y2);
			int k=0;
			for(int i=0;i<n;i++) {
				points[i]=new Point(sc.nextInt(),sc.nextInt());
				if(points[i].in(p1, p2)) {
					k++;
				}
			}
			System.out.println(k);
		}
	}
}