A mountaineering expedition's base camp keeps a log of n radio dispatch messages sent during the climb. Each message is one line of text made up of one or more words separated by exactly one space, with no leading or trailing spaces and no other whitespace inside a word. Determine the maximum number of words that appear in any single dispatch message in the log.

Input format

Line 1 contains a single integer n, the number of dispatch messages. Each of the next n lines contains one dispatch message: a non-empty string of English letters (upper or lower case) with words separated by single spaces, and no leading or trailing spaces.

Output format

Print a single integer: the largest number of words found in any one of the n dispatch messages.

Constraints

• 1 <= n <= 100
• each dispatch message has length between 1 and 100 characters (inclusive)
• each dispatch message contains only English letters and single spaces between words, has no leading or trailing spaces, and contains at least one word

2
camp secure all clear
resupply requested

4

3
go
storm warning issued for ridge camp
hold position

6