#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  int m = 1e9;
  int tek = 0;
  for (int i = 0; i < n; i++) {
    tek = tek + a[i] - b[i];
    m = min(m, tek);
  }
  set<int> ans;
  set<int>::iterator it;
  for (int i = 0; i < n; i++) {
    if (m >= 0) {
      ans.insert(i + 1);
    }
    m = m - a[i] + b[i];
  }
  tek = 0;
  m = 1e9;
  rotate(b.begin(), b.end() - 1, b.end());
  for (int i = n - 1; i >= 0; i--) {
    tek = tek + a[i] - b[i];
    m = min(m, tek);
  }
  for (int i = n - 1; i >= 0; i--) {
    if (m >= 0) {
      ans.insert(i + 1);
    }
    m = m - a[i] + b[i];
  }
  cout << ans.size() << endl;
  for (it = ans.begin(); it != ans.end(); it++) {
    printf("%d ", *it);
  }
  return 0;
}
