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 java.io.*;
import static java.lang.Math.*;

class Point{

    final double x;
    final double y;

    Point( final double x, final double y ) {
	this.x = x;
	this.y = y;
    }    
}

class Main {

    public static void main( final String[] args ) {

	final Scanner stdin = new Scanner( System.in );

	ArrayList<Point> list = new ArrayList<Point>();
	
	while ( stdin.hasNextLine() ) {

	    String[] input = stdin.nextLine().split( "," );
	    final double x = Double.parseDouble( input[0] );
	    final double y = Double.parseDouble( input[1] );
	    list.add( new Point( x, y ) );
	}

	double ans = 0.0;
	for ( int i = 1; i < list.size() - 1; i++ ) {
	    final Point p1 = list.get( 0 );
	    final Point p2 = list.get( i );
	    final Point p3 = list.get( i + 1 );

	    final double d12 = dist( p1, p2 );
	    final double d23 = dist( p2, p3 );
	    final double d31 = dist( p3, p1 );
	    ans += area( d12, d23, d31 );
	}
	System.out.println( ans );
    }

    static double area( double d1, double d2, double d3 ) {
	final double s = ( d1 + d2 + d3 ) / 2.0;
	return sqrt( s * ( s - d1 ) * ( s - d2 ) * ( s - d3 ) );
    }

    static double dist( Point p1, Point p2 ) {
	return sqrt( pow( p1.x - p2.x, 2.0 ) + pow( p1.y - p2.y, 2.0 ) );
    }
}