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 <vector>
using namespace std;
#define PI 3.14159265
#define rep(i,n) for(int i=0;i<n;i++)
struct P{double x,y;};

double dist(P a , P b){
	a.x-=b.x , a.y-=b.y;
	return sqrt(a.x * a.x + a.y * a.y);
}

double heron(P a , P b , P c){
	double l[3] = {dist(a,b),dist(b,c),dist(a,c)};
	double z = (l[0]+l[1]+l[2]) / 2.0;
	return sqrt( z*(z-l[0])*(z-l[1])*(z-l[2]) );
}
int main(){
	P t;
	vector<P> d;
	while(~scanf("%lf,%lf",&t.x,&t.y))d.push_back(t);
	double sum = 0;
	int n = d.size();
	for(int i=1;i+1<n;i++)sum += heron(d[0],d[i],d[i+1]);
	cout << sum << endl;
}