Area

For a given polygon g, computes the area of the polygon.

g is represented by a sequence of points p1, p2,..., pn where line segments connecting pi and pi+1 (1 ≤ i ≤ n-1) are sides of g. The line segment connecting pn and p1 is also a side of the polygon.

Note that the polygon is not necessarily convex.

Constraints

• 3 ≤ n ≤ 100
• -10000 ≤ xi, yi ≤ 10000
• No point will occur more than once.
• Two sides can intersect only at a common endpoint.

Input

The input consists of coordinates of the points p1,..., pn in the following format:

n x1 y1 x2 y2 : xn yn

The first integer n is the number of points. The coordinate of a point pi is given by two integers xi and yi. The coordinates of points are given in the order of counter-clockwise visit of them.

Output

Print the area of the polygon in a line. The area should be printed with one digit to the right of the decimal point.

Examples

Input

3 0 0 2 2 -1 1

Output

2.0

Input

4 0 0 1 1 1 2 0 2

Output

1.5

inputFormat

Input

The input consists of coordinates of the points p1,..., pn in the following format:

n x1 y1 x2 y2 : xn yn

The first integer n is the number of points. The coordinate of a point pi is given by two integers xi and yi. The coordinates of points are given in the order of counter-clockwise visit of them.

outputFormat

Output

Print the area of the polygon in a line. The area should be printed with one digit to the right of the decimal point.

Examples

Input

3 0 0 2 2 -1 1

Output

2.0

Input

4 0 0 1 1 1 2 0 2

Output

1.5

样例

4
0 0
1 1
1 2
0 2

1.5