Highest Productivity Score

You are given a list of productivity scores for a certain number of employees. Your task is to determine the highest productivity score and list the indices (0-indexed) of all employees who achieved this score.

Let \(S = [s_0, s_1, \ldots, s_{n-1}]\) be the list of scores. Your goal is to find the maximum value \(M = \max_{0 \le i < n} s_i\) and all indices \(i\) such that \(s_i = M\). If there are no scores, output None for the highest score and leave the indices list empty.

inputFormat

The input is given from standard input (stdin) and consists of two lines:

• The first line contains a single integer \(n\) representing the number of employees.
• If \(n > 0\), the second line contains \(n\) space-separated integers representing the productivity scores.

outputFormat

Print the highest productivity score on the first line. On the second line, print the 0-indexed positions (separated by a single space) of the employees who achieved this highest score. If the list of scores is empty (i.e. \(n = 0\)), print None on the first line and leave the second line empty.

## sample

5
10 20 20 5 15

20
1 2

</p>