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 <stdio.h>
#include <cstdio>
#include <vector>
#include <math.h>
using namespace std;
double helon(double x1,double y1,double x2,double y2,double x3,double y3){
	double a=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
	double b=sqrt((x3-x2)*(x3-x2)+(y3-y2)*(y3-y2));
	double c=sqrt((x1-x3)*(x1-x3)+(y1-y3)*(y1-y3));
	double z=(a+b+c)/2.0;
	double s=sqrt(z*(z-a)*(z-b)*(z-c));
	return s;
}
int main(){
	vector<double> x,y;
	double a,b,s,sum=0;
	while(scanf("%lf,%lf",&a,&b)!=EOF){
		x.push_back(a);
		y.push_back(b);
	}
	for(int i=1;i<x.size()-1;i++){
		s=helon(x[0],y[0],x[i],y[i],x[i+1],y[i+1]);
		sum+=s;
	}
	printf("%.6lf\n",sum);
	return 0;
}