An 8 \times 8 chessboard has rows and columns numbered from to . Vasily Pupkin has a chess piece, which he places on a cell each time. What is the maximum number of times his piece can be on the same cell?
The first line contains the number of moves (2 \leq n \leq 10^6). Each of the next lines contains two integers — the row and the column of the cell where the piece was placed on that move.
Print the required single number.
Example 1