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<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;

int main(){
    double tmp[20][2];
    int cnt=0;
    double ans=0.0;
    while (scanf("%lf,%lf",&tmp[cnt][0],&tmp[cnt][1])!=EOF) {
        cnt++;
    }
    for (int i=0;i<cnt;++i) {
        ans+=(tmp[i][0]-tmp[(i+1)%cnt][0])*(tmp[i][1]+tmp[(i+1)%cnt][1]);
    }
    ans=abs(ans);
    printf("%lf\n",ans/2.0);
    return 0;
}