Coaches Aram, Lucca, and David couldn't agree on who should order pizza. To avoid a fight in real life, they decided to battle in a video game while everyone else starves.
In this game, there are many fighters to choose from. Each fighter has a name and three integer _stats_ HP, AT, DF: the fighters' starting health points, attack strength and defence armour. One-on-one combat between Fighters $A$ and $B$ progresses in a series of rounds. In each round, Fighter $A$'s HP decreases by $max (0, "AT"_B -"DF"_A)$, while Fighter $B$'s HP _simultaneously_ decreases by $max (0, "AT"_A -"DF"_B)$. A fighter wins if, at the end of some round, their HP is positive while their opponent's HP is not. If this situation never occurs, the fight is ruled a draw with no winner.
Aram, Lucca, and David want a free-for-all. They decided that it would only be fun if they choose three fighters that form an _intransitive triple_. $A$, $B$ and $C$ are said to form an _intransitive triple_ if, in one-on-one combat, $A$ would win against $B$, $B$ would win against $C$, and $C$ would win against $A$.
Can you find all intransitive triples that Aram, Lucca, and David can choose from?
On the first line is a single integer $N$ $(1 <= N <= 100)$, the number of fighters.
On each of the next $N$ lines is a name consisting of 1 to 15 upper or lower case Latin letters, followed by three space-separated integers HP, AT and DF ($1 <= "HP", "AT", "DF"<= 10 thin 000$) denoting the health points, attack strength, and defence armour for that fighter.
The names of all the fighters are distinct from one another.
Output on the first line a single integer K, the number of intransitive triples.
On each of the next $K$ lines, output the names of three intransitive fighters separated by spaces. No two lines should describe the same set of fighters. Any ordering of intransitive triples, and of fighter names within an intransitive triple, will be accepted.
## Input
On the first line is a single integer $N$ $(1 <= N <= 100)$, the number of fighters.On each of the next $N$ lines is a name consisting of 1 to 15 upper or lower case Latin letters, followed by three space-separated integers HP, AT and DF ($1 <= "HP", "AT", "DF"<= 10 thin 000$) denoting the health points, attack strength, and defence armour for that fighter.The names of all the fighters are distinct from one another.
## Output
Output on the first line a single integer K, the number of intransitive triples.On each of the next $K$ lines, output the names of three intransitive fighters separated by spaces. No two lines should describe the same set of fighters. Any ordering of intransitive triples, and of fighter names within an intransitive triple, will be accepted.
[samples]
**Definitions**
Let $ K \in \mathbb{Z}^+ $, $ K \leq 10^9 $.
Let $ A \in \mathbb{Z}^+ $ be a positive integer such that both $ A $ and $ A + K $ have an odd number of positive divisors.
**Constraints**
1. $ A > 0 $
2. $ A + K > 0 $
3. The number of positive divisors of $ A $ is odd.
4. The number of positive divisors of $ A + K $ is odd.
**Objective**
Find all $ A \in \mathbb{Z}^+ $ such that both $ A $ and $ A + K $ are perfect squares.
(Note: A positive integer has an odd number of positive divisors if and only if it is a perfect square.)