In an attempt to predict required number of chairs in the library of the Aglargond School of Magic, Ataranon, school’s principal, ordered writing down the exact times of each person's entry and exit from the library. Write a program that counts the greatest number of people inside the library at one moment of time, if it is known that the total number of people that entered the library is N. Every person entered and exited the library during one day. The second one person enters or leaves the library is also counted as the second that person spent inside.

Input

The first line of input contains number N (0 <= N <= 1000). Next N lines contain hour, minute and second of entry and hour, minute and second of person’s exit, separated by one space. Times are represented in the format HH:MM:SS where HH represents hours (00 <= HH <= 23), MM (00 <= MM <= 59) represents minutes and SS (00 <= SS <= 59) represents seconds.

Output

The output has exactly one line that contains only the greatest number of people inside the library at one moment.

Constraints

Time limit: 3 seconds
Memory limit: 64 megabytes

Examples

input
4
08:00:00 10:00:11
09:00:23 14:00:06
11:00:52 13:00:24
11:15:17 13:15:08

output
3

During the interval between 11:15:17 and 13:00:24 there were three persons inside the library.