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
#include <iostream>
#include <cmath>
#include <cstdio>
#include <iomanip>
#define NUM 30
using namespace std;

double heron(double x0, double y0, double x1, double y1, double x2, double y2){
	double a, b, c, z, x, y;
	x = x0 - x1;
	y = y0 - y1;
	a = sqrt(x*x + y*y);

	x = x1 - x2;
	y = y1 - y2;
	b = sqrt(x*x + y*y);

	x = x2 - x0;
	y = y2 - y0;
	c = sqrt(x*x + y*y);

	z = (a+b+c) / 2.0;
	
	return sqrt(z * (z-a) * (z-b) * (z-c));
}

int main(){
	int n = 0;
	double ans = 0;
	double x[NUM], y[NUM];
	while (~scanf("%lf,%lf", &x[n], &y[n]) ) {
		n++;
	} 
	for (int i = 0; i < n-2; i++) {
		ans += heron(x[0], y[0], x[i+1], y[i+1], x[i+2], y[i+2]);
	}
	cout << setprecision(20);
	cout << ans << endl;

	return 0;
}