Shyamu loves watching IPL but this season he was busy in learning data structure and algorithms so he asked his friend Sahu that which team has won the final but in return Sahu gave him a grid consisting the results of all the matches. this season there were N teams. Each team played two matches with every others team, one at the home stadium of the first team and another at the home stadium of the second team.
And you all know tournament has already taken place and Shyamu has got the result of each match by Sahu. None of matches ended in a draw. Help Shyamu in finding the winner of tournament.
Standard input
The first line contains a single integer N.
Shyamu has that NXN grid which will work as your input.lets say the name of the grid is A then A[i][j] will represent the result of the match that ith team had played at its home ground with jth team.Value of A[i][j] will be 1 if home team won the match
or it will be 2 if visiting team won the match .
A[i][i] will always be 0 because a team can't play against itself.
Standard output
Print a single integer representing the index of the team that won the most matches. In case the answer is not unique, the team with the smallest index is declared the winner.Here index starts with 1
Constraints
2≤N≤100
Here First and Last team has won the maximum matches .But index number of first team is less so the answer will be 1.
