At competitions in chess composition, each participant is given 10 problems to solve. For each task, you can get from 0 to 5 points. For a correctly solved problem, the participant is awarded 5 points. If the problem is not solved completely or not correctly, then the participant is given a second attempt. In this case, for the task, the participant receives a score equal to the average score for two attempts, rounded according to the rules of mathematics.
Points are given in order from the first to the last solved problem.
Little Vitya Ch., participating in his first competition in his life, forgot how many problems he solved. Vitya Ch. remembers that he received only 10 ratings, as well as the ratings themselves in order.
Determine how many problems Vitya Ch. solved in total, how many problems he got the maximum score on the first attempt, and the total amount of points he scored.
Input
The program receives 10 lines, each of which contains one non-negative number from 0 to 5.
Imprint
Print in the first line the number of problems that Vitya Ch. managed to solve, in the second line - the number of problems that he solved on the first attempt for the maximum score, in the third line - the total number of points scored.
Examples
| # |
Input |
Output |
| 1 |
2
5
2
5
0
5
5
2
5
5 |
6
2
25 |