#include <bits/stdc++.h>
using namespace std;
const int L = 1e5 + 1;
long long a[L];
long long b[L];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", a + i);
  }
  for (int i = 0; i < n; i++) {
    scanf("%lld", b + i);
  }
  vector<int> ret;
  long long m = 0;
  long long c = 0;
  for (int i = 0; i < n; i++) {
    if (c < m) {
      ret.clear();
      m = c;
    }
    if (m == c) {
      ret.push_back(i);
    }
    c += a[i] - b[i];
  }
  m = 0;
  vector<int> ret2;
  for (int i = n - 1; i >= 0; i--) {
    if (c < m) {
      ret2.clear();
      m = c;
    }
    if (m == c) {
      ret2.push_back(i);
    }
    c += a[i] - b[(n + i - 1) % n];
  }
  for (auto i : ret2) {
    ret.push_back(i);
  }
  sort(ret.begin(), ret.end());
  ret.resize(unique(ret.begin(), ret.end()) - ret.begin());
  printf("%d\n", (int)ret.size());
  auto sp = "";
  for (auto i : ret) {
    printf("%s%d", sp, i + 1);
    sp = " ";
  }
  puts("");
  return 0;
}
