You are given a set of points on a plane.
You need to process two types of queries:
+ — Add the point (, ) to the set.
? x_1 y_1 x_2 y_2 — Determine how many points lie within the rectangle x_1..x_2 \times y_1..y_2. Points on the boundary and at the corners are included. It is guaranteed that x_1 \le x_2, y_1 \le y_2.
The first line contains the number of points (1 \le N \le 50000). Each of the next lines contains the coordinates of a point. Then follows the number of queries (1 \le Q \le 100000), followed by queries. All coordinates are integers from to 10^9 inclusive.
For each query of type ?, output a single integer — the number of points inside the specified rectangle.
مثال 1