## Algorithm

A. Average Numbers
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a sequence of positive integers a1, a2, ..., an. Find all such indices i, that the i-th element equals the arithmetic mean of all other elements (that is all elements except for this one).

Input

The first line contains the integer n (2 ≤ n ≤ 2·105). The second line contains elements of the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000). All the elements are positive integers.

Output

Print on the first line the number of the sought indices. Print on the second line the sought indices in the increasing order. All indices are integers from 1 to n.

If the sought elements do not exist, then the first output line should contain number 0. In this case you may either not print the second line or print an empty line.

Examples
input
Copy
`51 2 3 4 5`
output
Copy
`13 `
input
Copy
`450 50 50 50`
output
Copy
`41 2 3 4 `

## Code Examples

### #1 Code Example with C++ Programming

```Code - C++ Programming```

``````#include <cstdio>
#include <vector>

int main(){

long n(0); scanf("%ld", &n);
long *array = new long[n];
long total(0);
for(long k = 0; k < n; k++){scanf("%ld", array + k); total += array[k];}

std::vector<long> indices;
for(long k = 0; k < n; k++){if(array[k] * n == total){indices.push_back(k);}}

printf("%ld\n", indices.size());
for(long k = 0; k < indices.size(); k++){printf("%ld ", 1 + indices[k]);}
puts("");

return 0;
}``````
Copy The Code &

Input

cmd
5
1 2 3 4 5

Output

cmd
1
3