Information about the number of residents in each of the M apartments of each floor of a 12-storey building is stored in a two-dimensional array (in the zero line - information about the apartment on the first floor, in the first - on the second, etc.). Determine on which floor the most people live. Print this number and the numbers of all such floors.
Input: number M is given in the first line (0<M<=25)
Then there are 12 lines of M numbers each (an integer not exceeding 10)
Output:
Examples
| # |
Input |
Output |
| 1 |
4
1 0 2 0
1 1 2 0
0 0 2 0
0 0 1 2
2 0 1 1
1 2 2 0
2 2 0 0
2 1 2 2
2 1 2 1
2 2 1 2
2 1 0 2
1 2 0 2 |
7
8 10
|