Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9 + 10;

double cross_product(complex<double> a, complex<double> b) {
  return (conj(a) * b).imag();
}

int main() {
  double x, y;
  vector<complex<double>> P;
  while (~scanf("%lf,%lf", &x, &y)) {
    P.push_back(complex<double>(x, y));
  }
  double sum = 0.0;
  for (int i = 0; i + 2 < P.size(); i++) {
    complex<double> a = P[0], b = P[i + 1], c = P[i + 2];
    sum += cross_product(b - a, c - a) / 2;
  }
  printf("%.6f\n", abs(sum));
}