#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
long long sum[N], a[N];
vector<int> ans;
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    sum[i] = a[i] + (!i ? 0 : sum[i - 1]);
  }
  for (int i = 0; i < n; i++)
    if (a[i] * (n - 1) == (!i ? 0 : sum[i - 1]) + sum[n - 1] - sum[i])
      ans.push_back(i + 1);
  cout << ans.size() << endl;
  for (size_t i = 0; i < ans.size(); i++) cout << ans[i] << " ";
  return 0;
}
