The brave knights of Camelot take steady French taunting from the castle walls while they press their assault. The intensity of the taunting changes with the distance between a knight and the castle, and with how energetic the defenders happen to be. We want to estimate the total taunting the knights absorbed over a fixed stretch of time.
The equipment is old and cannot read continuously. All that survives is a set of measurements taken at unpredictable moments.
The total is the integral of the taunting intensity over the span the data covers. Noise in the readings is high enough that a trapezoid rule approximation is all the data deserves. For every pair of consecutive measurements, compute (xi+1−xi)⋅2yi+yi+1 and add the pieces together.

The first line contains n, the number of data points.
Each of the next n lines holds one measurement: two floating point numbers separated by a comma, which may be followed by a space. The first number is the x coordinate (the time of the reading) and the second is the y coordinate (the taunting intensity). The whole file is plain CSV that a spreadsheet program could open.
The x coordinates are given in increasing order.
1≤n≤1000, every coordinate has absolute value at most 1000, and no coordinate carries more than six digits after the decimal point.
Print one line with the first x value, the last x value, and the computed integral in this shape.
<first x> to <last x>: <integral>
Round the x values to two digits after the decimal point and the integral to four digits. With a single data point the integral is 0 and the two x values are equal.
Every test stays well away from a rounding boundary, so double precision arithmetic fixes the digits you have to print.