#include int abs(int n) { if (n < 0) n *= -1; return n; } int f(int x[], int y[]) { return abs((x[1] - x[0]) * (y[2] - y[0]) - (x[2] - x[0]) * (y[1] - y[0])); } int max(int a, int b) { if (a > b) return a; else return b; } int main() { int x[3], y[3]; int i, j, k; for (i = 0; i < 3; i++) scanf("%d%d", &x[i], &y[i]); int ans = 0; int dx[4] = { 1,-1,0,0 }; int dy[4] = { 0,0,1,-1 }; for (i = 0; i < 4; i++) { x[0] += dx[i]; y[0] += dy[i]; for (j = 0; j < 4; j++) { x[1] += dx[j]; y[1] += dy[j]; for (k = 0; k < 4; k++) { x[2] += dx[k]; y[2] += dy[k]; ans = max(ans, f(x, y)); x[2] -= dx[k]; y[2] -= dy[k]; } x[1] -= dx[j]; y[1] -= dy[j]; } x[0] -= dx[i]; y[0] -= dy[i]; } printf("%.1lf\n", ans / 2.0); return 0; }