Imena

Mirko likes to type, but he gets bored in class, so his teacher gave him an assignment.

Mirko has to retype a book that holds $N$ sentences. In this book a sentence is one or more words separated by spaces, and only the last character of the last word is a punctuation mark ('.', '?' or '!'). No other word contains a punctuation mark.

A word is a string of uppercase English letters, lowercase English letters and digits. The one exception is the last word of a sentence, which carries a single punctuation mark at its end.

Mirko likes typing sentences but hates typing names. A name is a word whose first character is an uppercase English letter and whose remaining characters are all lowercase English letters. If the last character is a punctuation mark, drop that mark before applying the test. Before he starts retyping, Mirko wants to know how many names each sentence contains. Write a program that tells him.

The first line contains the integer $N$ ($1 \le N \le 5$).

The second line contains the $N$ sentences of the book in order, separated by spaces. The total number of characters in the book does not exceed $1\,000$.

Print $N$ lines. Line $i$ contains the number of names in sentence $i$.