Write a program that reads the coordinates of the vertices of a convex n-sided polygon (a polygon whose internal angles are less than 180 degrees, that is, a polygon that is not dented) and outputs its area. The vertices are named Vertex 1, Vertex 2, Vertex 3, ... Vertex n according to the order of edge connections.

However, n is 3 or more and 20 or less. You can also use the following formula to find the area S from the lengths a, b, and c of the three sides of the triangle.

<image>



input

The input is given in the following format:


x1, y1
x2, y2
::
xn, yn


xi and yi are real numbers that represent the x and y coordinates of vertex i, respectively.

output

Outputs the area S (real number) on one line. The output can contain an error of 0.000001 or less.

Example

Input

0.0,0.0
0.0,1.0
1.0,1.0
2.0,0.0
1.0,-1.0


Output

2.500000

import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;

public class Main {

	int INF = 1 << 28;
	void run() {
		Scanner sc = new Scanner(System.in);
		double s = 0;
		double[] x = new double[3];
		double[] y = new double[3];
		String[] str = sc.next().split(",");
		x[0] = Double.parseDouble(str[0]);
		y[0] = Double.parseDouble(str[1]);
		str = sc.next().split(",");
		x[2] = x[1] = Double.parseDouble(str[0]);
		y[2] = y[1] = Double.parseDouble(str[1]);
		
		while(sc.hasNext()) {
			x[1] = x[2];
			y[1] = y[2];
			str = sc.next().split(",");
			x[2] = Double.parseDouble(str[0]);
			y[2] = Double.parseDouble(str[1]);
			s += area( line(x, y) );
		}
		System.out.println(s);
	}
	double[] line(double[] x, double[] y) {
		double[] d = new double[3];
		for(int i=0;i<3;i++) {
			d[i] = sqrt( (x[i]-x[(i+1)%3])*(x[i]-x[(i+1)%3]) + (y[i]-y[(i+1)%3])*(y[i]-y[(i+1)%3]) );
		}
		return d;
	}
	
	double area(double[] d) {
		double len = (d[0] + d[1] + d[2])/2;
		return sqrt( len * (len-d[0]) * (len-d[1]) * (len-d[2]) );
	}
	
	public static void main(String[] args) {
		new Main().run();
	}
}