Mountain View#10269
Kozak Vus is a very athletic boy, so he likes mountaineering. Therefore, this winter he decided to go to the mountains (unfortunately, he did not say where).
There are a total of separate mountain peaks located along a straight line, the th peak has a height of a_i meters and a beauty of b_i. Kozak Vus does the following: he climbs one of the mountains, looks left and right, after which he sees some other mountains. Kozak Vus can see the th mountain if there are no mountains greater than or equal to a_i meters high between the mountain where he is and the th mountain. Kozak Vus also sees the mountain he climbed.
Kozak Vus set two parameters for himself: and . If he climbs meter, his mood decreases by units, and if he sees a mountain with beauty, then his mood increases by units. Initially, the mood of Kozak Vus is .
Find the maximum possible mood of Kozak Vus after climbing one of the mountains.
Note that Kozak Vus needs to climb some mountain.
The first line contains a single integer (1 \leq n \leq 10^6) — the number of mountains.
Each of the following lines contains two integers a_i and b_i (1 \leq a_i, b_i \leq 1000) — the height and beauty of the -th mountain.
The last line contains two integers and (1 \leq x, y \leq 1000).
Output a single number — the maximum possible mood of Kozak Vus after climbing one of the mountains.
Example 1
Example 2
Example 3