CODE APOCALYPSE 2.0 #3 days of hell

Worlds best hacker seal_7 is back and he is planning to bring CODE APOCALYPSE again on the world. He wants to conduct a meeting with other hackers to discuss his plans. Now the problem is there are N number of rooms (numbered from 1 to N) having strength Si (1<=i<=N). seal_7 does not know the count of the hackers that are going to attend his secret meeting. So he decides to select the rooms having Mean Strength of all the rooms. As you are friend of seal_7, he invites you to CODE APOCALYPSE 2.0 by helping him find all those room with mean strength.

Input
The first line contains the integer N (2 ≤ N ≤ 2*10^5) the number of rooms .The second line contains Strengths of rooms s1, s2, ..., sn (1 ≤ si ≤ 1000).
Output
Print on the first line the total number of Lucky rooms .
In second line print the positions of all those rooms in increasing order.

If the such rooms do not exist, then the first output line should contain number 0. In this case no need to print second line.
Note:-The students who are not able to help us here come and participate in Code Apoclypse this event will definitely help you in helping anyone else next time.