#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
long long gasoline[maxn], dist_left[maxn], dist_right[maxn];
int n;
bool pos[maxn];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &gasoline[i]);
  for (int i = 1; i <= n; i++) scanf("%lld", &dist_right[i]);
  for (int i = 2; i <= n; i++) dist_left[i] = dist_right[i - 1];
  dist_left[1] = dist_right[n];
  long long minn = 1e9, sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += (gasoline[i] - dist_right[i]);
    minn = min(sum, minn);
  }
  if (minn >= 0) pos[1] = true;
  for (int i = n; i > 1; --i) {
    minn += (gasoline[i] - dist_right[i]);
    if (minn >= 0) pos[i] = true;
  }
  minn = 1e9;
  sum = 0;
  for (int i = n; i >= 1; --i) {
    sum += (gasoline[i] - dist_left[i]);
    minn = min(minn, sum);
  }
  if (minn >= 0) pos[n] = true;
  for (int i = 1; i < n; i++) {
    minn += (gasoline[i] - dist_left[i]);
    if (minn >= 0) pos[i] = true;
  }
  int cnt = 0;
  for (int i = 1; i <= n; i++)
    if (pos[i]) cnt++;
  printf("%d\n", cnt);
  for (int i = 1; i <= n; i++)
    if (pos[i]) printf("%d ", i);
  return 0;
}
