CSES - Area of Rectangles
  • Time limit: 1.00 s
  • Memory limit: 512 MB

Given nn rectangles, your task is to determine the total area of their union.

Input

The first input line has an integer nn: the number of rectangles.

After that, there are nn lines describing the rectangles. Each line has four integers x1x_1, y1y_1, x2x_2 and y2y_2: a rectangle begins at point (x1,y1)(x_1,y_1) and ends at point (x2,y2)(x_2,y_2).

Output

Print the total area covered by the rectangles.

Constraints

  • 1n1051 \le n \le 10^5
  • 106x1<x2106-10^6 \le x_1 < x_2 \le 10^6
  • 106y1<y2106-10^6 \le y_1 < y_2 \le 10^6

Example

Input:

3
1 3 4 5
3 1 7 4
5 3 8 6

Output:

24