#include <bits/stdc++.h>
using namespace std;
long long a[100000], b[100000], c[100000];
int t[100000];
int main() {
  for (int i = 0; i < 100000; i++) t[i] = 0;
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d", a + i);
  for (int i = 0; i < n; i++) scanf("%I64d", b + i);
  if (n == 1) {
    printf("1\n1");
    return 0;
  }
  c[0] = 0;
  long long m = 0;
  for (int i = 1; i < n; i++)
    if ((c[i] = c[i - 1] + a[i - 1] - b[i - 1]) < m) m = c[i];
  for (int i = 0; i < n; i++)
    if (c[i] == m) t[i] = 1;
  c[n - 1] = 0;
  m = 0;
  for (int i = n - 2; i >= 0; i--)
    if ((c[i] = c[i + 1] + a[i + 1] - b[i]) < m) m = c[i];
  for (int i = 0; i < n; i++)
    if (c[i] == m) t[i] = 1;
  vector<int> q(0);
  for (int i = 0; i < n; i++)
    if (t[i]) q.push_back(i + 1);
  printf("%d\n", q.size());
  for (int i = 0; i < q.size(); i++) printf("%d ", q[i]);
  return 0;
}
