Note: This is an approximate problem. There is no exact solution. You must find the most optimal solution. Please, take a look at the sample explanation to ensure that you understand the problem correctly.

Problem statement

You are given $N$ strings. Each string is given in the form of an array cnt of size 26 where the $i^{th}$ element in array denotes the count of the $i^{th}$ character of lowercase English alphabets in the string.

You have to select exactly 4 distinct strings.

These strings will be inserted into a Trie in an optimal way (which might include shuffling of the characters), ensuring that the number of nodes in the Trie is minimized by the checker.

Your goal is to minimize the value of function Z,

• Z = Number of nodes in the Trie.

Notes

• Trie will always have a root node. Include root node in the count of nodes present in Trie.
• Insertion proceeds by walking the Trie according to the string to be inserted, then appending new nodes for the suffix of the string that is not contained in the Trie.

Input format

• The first line contains an integer $N$.
• The next $N$ lines contain 26 space-separated integers denoting the count of each lowercase English alphabet in the string.

Output format

Print 4 space separated integers (1-based), denoting the indices of the strings selected.

Constraints

$N = 300 \\ 0 \le cnt[i][j] \le 10^5 \\ \text{No string is empty}$

Verdit and Scoring

• Z is the score for each test case.
• If the indices are invalid, then you will receive a Wrong Answer verdict.