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
#define _USE_MATH_DEFINES
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<list>
#include<stack>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;

struct Point{
	double x,y;
};

double GetDist(Point p,Point q){
	double a,b;
	a = p.x-q.x; b = p.y-q.y;
	return sqrt(a*a+b*b);
}

int main(){
	Point P[20];
	double ans=0;
	for(int i=0;scanf("%lf,%lf",&P[i].x,&P[i].y)!=EOF;i++){
		if(i>=2){
			double a,b,c;
			a = GetDist(P[0],P[i-1]);
			b = GetDist(P[i-1],P[i]);
			c = GetDist(P[i],P[0]);
			double z = (a+b+c)/2;
			ans += sqrt(z*(z-a)*(z-b)*(z-c));
		}
	}
	printf("%lf\n",ans);
}