#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, a[100010], b[100010];
  long long m = 0, s = 0;
  set<long long> r;
  cin >> n;
  for (int i = 0; i <= n - 1; i++) cin >> a[i];
  for (int i = 0; i <= n - 1; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) {
    s += a[i - 1] - b[i - 1];
    m = min(s, m);
  }
  for (int i = 0; i <= n - 1; i++) {
    if (m >= 0) r.insert(i + 1);
    m -= (a[i] - b[i]);
  }
  s = m = 0;
  for (int i = n - 1; i >= 0; i--) {
    s += a[(i + 1) % n] - b[i];
    m = min(s, m);
  }
  if (m >= 0) r.insert(1);
  for (int i = n - 1; i >= 1; i--) {
    m -= (a[(i + 1) % n] - b[i]);
    if (m >= 0) r.insert(i + 1);
  }
  cout << r.size() << endl;
  for (set<long long>::iterator it = r.begin(); it != r.end(); it++)
    cout << (*it) << " ";
  cout << endl;
}
