The School №0 of the capital of Berland has?n?children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value?ti:

• ti?=?1, if the?i-th child is good at programming,

• ti?=?2, if the?i-th child is good at maths,

• ti?=?3, if the?i-th child is good at PE

Each child happens to be good at exactly one of these three subjects.

The Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.

What is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?

In the first line output integer w — the largest possible number of teams.

Then print w lines, containing three numbers in each line. Each triple represents the indexes of the children forming the team. You can print both the teams, and the numbers in the triplets in any order. The children are numbered from 1 to n in the order of their appearance in the input. Each child must participate in no more than one team. If there are several solutions, print any of them.

If no teams can be compiled, print the only line with value w equal to 0.

543?/?5,000

中文：

第一行輸出整數(shù) w — 最大可能的團(tuán)隊(duì)數(shù)。 然后打印w行，每行包含三個(gè)數(shù)字。 每個(gè)三元組代表組成團(tuán)隊(duì)的孩子的索引。 您可以按任意順序打印球隊(duì)和三元組中的數(shù)字。 子項(xiàng)按照其在輸入中出現(xiàn)的順序從 1 到 n 進(jìn)行編號(hào)。 每個(gè)孩子只能參加不超過一個(gè)團(tuán)隊(duì)。 如果有多個(gè)解決方案，請(qǐng)打印其中任何一個(gè)。 如果無法編譯任何團(tuán)隊(duì)，則打印 w 值等于 0 的唯一行。

-----------------------------------------------------------------------

其實(shí)就是將所有的種類找到，看對(duì)應(yīng)的最小值就是可能組成的隊(duì)伍數(shù)量，然后我是用優(yōu)先隊(duì)列保存的索引，依次取出即可，（也可以用ArrayList）下面是代碼：