#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
template <class T>
inline string ns(const T &number) {
  stringstream ss;
  ss << number;
  return ss.str();
}
template <class T>
inline T sn(const string &text) {
  stringstream ss(text);
  T result;
  return ss >> result ? result : 0;
}
template <class T>
T pow2(const int &x) {
  return (T)1 << x;
}
template <class T>
int log2(T x) {
  int res = 0;
  while (x >>= 1) ++res;
  return res;
}
class disjoint_set {
 public:
  vector<int> pset;
  int _sz;
  int find(const int &x) {
    return (x == pset[x] ? x : pset[x] = find(pset[x]));
  }
  inline int size() { return _sz; }
  inline void init(const int &n) {
    pset.resize(n);
    for (int i = 0; i < (n); ++i) pset[i] = i;
    _sz = n;
  }
  disjoint_set(){};
  disjoint_set(const int &n) { init(n); }
  inline bool same(const int &x, const int &y) { return (find(x) == find(y)); }
  inline bool join(const int &x, const int &y) {
    int xx = find(x), yy = find(y);
    if (xx == yy) return false;
    pset[xx] = yy;
    return true;
  }
};
int n;
void process(const vector<int> &diff, vector<bool> &mark) {
  vector<int> left(n), right(n), sleft(n);
  int s = 0;
  for (int i = 0; i < (n); ++i) sleft[i] = (s += diff[i]);
  for (int i = (n); i--;)
    right[i] = min(sleft[i], (i == n - 1 ? INT_MAX : right[i + 1]));
  for (int i = 0; i < (n); ++i) {
    left[i] = (!i ? INT_MAX : min(left[i - 1], s));
    s += diff[i];
  }
  for (int i = 0; i < (n); ++i)
    mark[i] = ((!i ? 0 : sleft[i - 1]) <= min(left[i], right[i]));
}
int main() {
  srand(time(NULL));
  cin >> n;
  vector<bool> mark1(n, false), mark2(n, false), mark(n);
  vector<int> diff(n), a(n), b(n);
  for (int i = 0; i < (n); ++i) cin >> a[i];
  for (int i = 0; i < (n); ++i) cin >> b[i];
  for (int i = 0; i < (n); ++i) diff[i] = a[i] - b[i];
  process(diff, mark1);
  for (int i = 0; i < (n); ++i)
    diff[i] = (i ? a[i] - b[i - 1] : a[i] - b[n - 1]);
  reverse((diff).begin(), (diff).end());
  process(diff, mark2);
  reverse((mark2).begin(), (mark2).end());
  for (int i = 0; i < (n); ++i) mark[i] = mark1[i] || mark2[i];
  cout << count((mark).begin(), (mark).end(), true) << endl;
  bool first = true;
  for (int i = 0; i < (n); ++i)
    if (mark[i]) {
      if (first)
        first = false;
      else
        cout << " ";
      cout << i + 1;
    }
  return 0;
}
