PROGRAMMING:The number of integers
###Task description
Given K (1 < K < 100) positive integers, where each number is greater than or equal to 1 and less than or equal to 10. Write a program to calculate the number of occurrences of 1, 5 and 10 in a given K positive integers.
###Input format:
Input has two lines: the first line contains a positive integer k, the second line contains k positive integers, each two positive integers separated by a space.
###Output format:
The output has three lines: the number of occurrences of the first line 1, the number of occurrences of the second line 5, and the number of occurrences of the third line 10.
###Input example:
```in
five
1 5 8 10 5
```
###Output example:
```out
one
two
one
```
###Title Source
Note: selected from openjudge website, online address: http://sdau.openjudge.cn/c/004/ .
###Problem analysis:
This problem first reads in the integer n, and then processes n data through N cycles. In the cycle, the integer value is determined and counted through multiple branches.
answer：If there is no answer, please comment
Given K (1 < K < 100) positive integers, where each number is greater than or equal to 1 and less than or equal to 10. Write a program to calculate the number of occurrences of 1, 5 and 10 in a given K positive integers.
###Input format:
Input has two lines: the first line contains a positive integer k, the second line contains k positive integers, each two positive integers separated by a space.
###Output format:
The output has three lines: the number of occurrences of the first line 1, the number of occurrences of the second line 5, and the number of occurrences of the third line 10.
###Input example:
```in
five
1 5 8 10 5
```
###Output example:
```out
one
two
one
```
###Title Source
Note: selected from openjudge website, online address: http://sdau.openjudge.cn/c/004/ .
###Problem analysis:
This problem first reads in the integer n, and then processes n data through N cycles. In the cycle, the integer value is determined and counted through multiple branches.
answer：If there is no answer, please comment