eolymp
bolt
Try our new interface for solving problems
Problems

Express delivery

Express delivery

Time limit 1 second
Memory limit 32 MiB

Your company, Byteland Express, has to deliver some papcels to clients located somewhere in the city. The city consist of 2·10^9+1 south-north streets and 2·10^9+1 west-east streets (both numbered from 0 to 2·10^9). A postman dreves from one junction to a neighbouring one in one minute. The company is located next to the junction of streets number x_c and y_c.

All parcels have to be delivered as fast as possible, so driving to a client located next to the junction of the x-th andy-th street, can take at most (= exactly) |x_c-x|+|y_c-y| minutes. It takes a very short time to give a parcel to a client? so while driving to one client, a postman can give a parcel to another client (but can not choose longer route to do that). Your task is to determine how many postmen are needed to perform the delivery.

Task

Write a programm, that

  • reads using SVIO the position of the company and positions of all the clients,

  • finds the minimal number of postmen needed to deliver all the parcels,

  • writes the result using SVIO.

Input data

First line of input contains one integer N (1N1000000). Second line contains location of the compane, the following N lines contain locations oa the clients. A description of the location consists of two integers: coordinates x andy (0x, y2·10^9). Every two points (from among company or clients) differ on both coordinates (every x is different and every y is different).

Output data

In the only line of the standart output write one inteher: yhe number of postmen needed to deliver parcels to all clients.

Examples

Input example #1
4
0 3
1 2
2 5
3 0
4 1
Output example #1
3