#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
int n;
int a[1 << 17], b[1 << 17];
int need[1 << 17];
int OK[1 << 17], FOK[1 << 17];
;
inline void init() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  for (int i = 0; i < n; ++i) scanf("%d", &b[i]);
}
void solve() {
  memset(OK, 0, sizeof OK);
  need[0] = 0;
  int oil = a[0];
  int dist = b[0];
  for (int i = 1; i < n; ++i) {
    need[i] = max(need[i - 1], dist - oil);
    oil += a[i];
    dist += b[i];
  }
  int OIL = 0, CO = 0;
  int DIST = 0, CD = 0;
  for (int i = n - 1; i >= 0; --i) {
    OIL += a[i];
    DIST += b[i];
    CO += a[i];
    CD += b[i];
    if (CO - CD < 0) continue;
    if (need[i] <= OIL - DIST) OK[i] = 1;
    CO = 0;
    CD = 0;
  }
}
int main() {
  init();
  solve();
  for (int i = 0; i < n; ++i) FOK[i] = OK[i];
  reverse(a, a + n);
  reverse(b, b + n - 1);
  solve();
  int m = 0;
  for (int i = 0; i < n; ++i) {
    FOK[i] = max(FOK[i], OK[n - i - 1]);
    if (FOK[i]) ++m;
  }
  printf("%d\n", m);
  for (int i = 0; i < n; ++i)
    if (FOK[i]) printf("%d ", i + 1);
  return 0;
}
