PROGRAMMING:Count the number of uppercase letters, lowercase letters, spaces and punctuation marks
Input n (1 < = n < = 10) lines of characters (within 80 characters per line), and count the number of uppercase letters, lowercase letters, spaces and punctuation marks (punctuation marks include:,.;!?).
###Input format:
There are several groups of test data, which are processed to the end of the file. Input n (1 < = n < = 10) in the first line of each group of test data,
Input no more than 80 characters including upper case letters, lower case letters, spaces and punctuation marks in the first n lines of the second line.
###Output format:
Each group outputs the number of upper case letters, lower case letters, spaces and punctuation marks in the n-line characters. A space between each output item.
###Input example:
Here is a set of inputs. For example:
```in
three
In this paper, a new sort method of Kway insertion is put forward.
and its algorithmic ideas, and algorithmic description,
and its algorithmic analysis, and its experimental results is given.
six
The theoretical significance lies has the sort
time complexity is nlogn,
and it has nothing to do with data type and number range.
Its practical value is the sorting more efficiency,
the average sorting speed is quicker times
then straight insertion sort and quicker then shell sort.
```
###Output example:
The corresponding output is given here. For example:
```out
lowercase=154 capital=2 space=28 sign=6
lowercase=231 capital=2 space=41 sign=4
```
answer：If there is no answer, please comment
###Input format:
There are several groups of test data, which are processed to the end of the file. Input n (1 < = n < = 10) in the first line of each group of test data,
Input no more than 80 characters including upper case letters, lower case letters, spaces and punctuation marks in the first n lines of the second line.
###Output format:
Each group outputs the number of upper case letters, lower case letters, spaces and punctuation marks in the n-line characters. A space between each output item.
###Input example:
Here is a set of inputs. For example:
```in
three
In this paper, a new sort method of Kway insertion is put forward.
and its algorithmic ideas, and algorithmic description,
and its algorithmic analysis, and its experimental results is given.
six
The theoretical significance lies has the sort
time complexity is nlogn,
and it has nothing to do with data type and number range.
Its practical value is the sorting more efficiency,
the average sorting speed is quicker times
then straight insertion sort and quicker then shell sort.
```
###Output example:
The corresponding output is given here. For example:
```out
lowercase=154 capital=2 space=28 sign=6
lowercase=231 capital=2 space=41 sign=4
```
answer：If there is no answer, please comment