Confidentiality#5985
Four programmers work together in an office on a single project. According to their contract, they are not allowed to disclose their salaries to each other, so that higher-paid employees do not provoke envy among colleagues. However, they are not just mere PHP programmers; they have managed to calculate their average salary, without breaching the contract's conditions. After this calculation, each programmer states whether they are satisfied or dissatisfied. A programmer is satisfied if their salary is at least equal to the average salary in the office; otherwise, they are dissatisfied. You are the company manager.
Your task is, based on the available data, to determine which programmers can reliably identify at least one of the highest-paid employees, and which can reliably identify all of them.
The input consists of a single line containing natural numbers, representing the programmers' monthly salaries in dollars. It is known that programmers are not a wealthy group, so none of the salaries exceed 10^9 dollars, and all are at least dollar.
Print numbers, separated by a space: the first is the number of programmers who can determine at least one of the highest-paid employees, and the second is the number who can determine all of them.
Example 1