#!/usr/bin/env python

import collections
import functools
import itertools
import operator
import sys
from collections.abc import Iterable
from typing import Generic, Hashable, NamedTuple, TypeVar


class Point(NamedTuple):
    x: int
    y: int
    z: int


class UnionFind:
    _parent: list[int]
    _rank: list[int]

    def __init__(self, size: int):
        # Each node is in its own set, making it its own parent...
        self._parent = list(range(size))
        # ... And its rank 0
        self._rank = [0] * size

    def find(self, elem: int) -> int:
        while (parent := self._parent[elem]) != elem:
            # Replace each parent link by a link to the grand-parent
            elem, self._parent[elem] = parent, self._parent[parent]
        return elem

    def union(self, lhs: int, rhs: int) -> int:
        lhs = self.find(lhs)
        rhs = self.find(rhs)
        # Bail out early if they already belong to the same set
        if lhs == rhs:
            return lhs
        # Always keep `lhs` as the taller tree
        if self._rank[lhs] < self._rank[rhs]:
            lhs, rhs = rhs, lhs
        # Merge the smaller tree into the taller one
        self._parent[rhs] = lhs
        # Update the rank when merging trees of approximately the same size
        if self._rank[lhs] == self._rank[rhs]:
            self._rank[lhs] += 1
        return lhs

    def sets(self) -> dict[int, set[int]]:
        res: dict[int, set[int]] = collections.defaultdict(set)
        for elem in range(len(self._parent)):
            res[self.find(elem)].add(elem)
        return dict(res)


# PEP 695 still not supported by MyPy...
T = TypeVar("T", bound=Hashable)


class DisjointSet(Generic[T]):
    _values: list[T]
    _to_index: dict[T, int]
    _sets: UnionFind

    def __init__(self, values: Iterable[T]) -> None:
        self._values = list(values)
        self._to_index = {v: i for i, v in enumerate(self._values)}
        self._sets = UnionFind(len(self._values))

    def find(self, elem: T) -> T:
        return self._values[self._sets.find(self._to_index[elem])]

    def union(self, lhs: T, rhs: T) -> T:
        return self._values[self._sets.union(self._to_index[lhs], self._to_index[rhs])]

    def sets(self) -> dict[T, set[T]]:
        sets = self._sets.sets()
        return {
            self._values[r]: {self._values[i] for i in values}
            for r, values in sets.items()
        }


def solve(input: list[str]) -> int:
    def parse(input: list[str]) -> list[Point]:
        return [Point(*map(int, line.split(","))) for line in input]

    def sq_dist(p: Point, other: Point) -> int:
        return sum(abs(a - b) ** 2 for a, b in zip(p, other))

    def list_connections(boxes: list[Point]) -> list[tuple[Point, Point]]:
        connections = itertools.combinations(boxes, 2)
        return sorted(connections, key=lambda con: sq_dist(*con))

    def connect_boxes(boxes: list[Point], n: int = 1000) -> DisjointSet[Point]:
        connections = list_connections(boxes)
        sets = DisjointSet(boxes)
        for a, b in connections[:n]:
            sets.union(a, b)
        return sets

    boxes = parse(input)
    connected = connect_boxes(boxes)
    circuit_sizes = collections.Counter(
        {r: len(val) for r, val in connected.sets().items()}
    )
    return functools.reduce(
        operator.mul, (size for _, size in circuit_sizes.most_common(3))
    )


def main() -> None:
    input = sys.stdin.read().splitlines()
    print(solve(input))


if __name__ == "__main__":
    main()