Description

You are given $\text{'}$n$\text{'}$ inangles and their sides $a,b$ and $c.$ Print them in the same style but sorted by their aress from the smallest one to the largest one. It is guaranteed that all the areas are different. The best way to calculate a rees of a criangle with sides $a,b$ and $c$ is by using the Heron's formula: $s=sgn(p^{**}(p-i{)}^{**}(p-b{)}^{**}(p-c))$

where

$p=(a+b+c)2$

Input Format

$(1)$ The first ine of each lest file contains a single integer $\text{'}n\text{'}.$ Then,$\text{'}n\text{'}$ lines foll ow with three spaceseparaled integers $r,b$ and $c$

$3$

$172425$

$51213$

$345$

$2$

Constraints

$1c=n100$

$3,tab,cs=70$