#include <bits/stdc++.h>
using namespace std;
int a[int(1e5 + 5)], b[int(1e5 + 5)];
int d = (int)1e9;
int n;
set<int> ans;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
  }
  int k = 0;
  for (int i = 0; i < n; ++i) {
    k += (a[i] - b[i]);
    d = min(d, k);
  }
  if (d >= 0) {
    ans.insert(1);
  }
  for (int i = 1; i <= n - 1; ++i) {
    d = d - (a[i - 1] - b[i - 1]);
    if (d >= 0) {
      ans.insert(i + 1);
    }
  }
  int uki = 0, ukj = n - 1;
  k = 0, d = (int)1e9;
  for (int i = 0; i < n; ++i) {
    k += (a[uki--] - b[ukj--]);
    d = min(d, k);
    uki = (uki < 0) ? (n - 1) : (uki);
  }
  if (d >= 0) {
    ans.insert(1);
  }
  uki = 0, ukj = n - 1;
  for (int i = n - 1; i > 0; --i) {
    d = d - (a[uki--] - b[ukj--]);
    uki = (uki < 0) ? (n - 1) : (uki);
    if (d >= 0) {
      ans.insert(i + 1);
    }
  }
  cout << ans.size() << endl;
  while (ans.size() != 0) {
    cout << *(ans.begin()) << ' ';
    ans.erase(ans.begin());
  }
  return 0;
}
