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<complex>
#include<cstdio>
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;

typedef complex<double> Point;

#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

typedef vector<Point> Polygon;

double cross(const Point &a, const Point &b) {
  return imag(conj(a)*b);
}

double area(const Polygon &p) {
  double A = 0;
  for(int i=0; i<p.size(); i++) {
    A += cross( p[i], p[(i+1)%p.size()] );
  }
  return A;
}

int main() {
  int n,count = 1;
  double x,y;

  Polygon p = Polygon();
  while(~scanf("%lf,%lf", &x,&y)) {
    p.push_back( Point(x,y) );
  }

  double a = area(p)/2;
  printf("%f\n", (a < 0) ? -a : a);
  count++;
}