#include <bits/stdc++.h>
using namespace std;
inline void pisz(int n) { printf("%d\n", n); }
template <typename T, typename TT>
ostream& operator<<(ostream& s, pair<T, TT> t) {
  return s << "(" << t.first << "," << t.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, vector<T> t) {
  for (int(i) = 0; (i) < (((int)(t.size()))); ++(i)) s << t[i] << " ";
  return s;
}
int a[100006], b[100006], A[100006], B[100006], mozna[100006], ar[100006],
    br[100006], Ar[100006], Br[100006];
int main() {
  int(n);
  scanf("%d", &(n));
  for (int(i) = 1; (i) <= (n); ++(i)) scanf("%d", a + i);
  for (int(i) = 1; (i) <= (n); ++(i)) scanf("%d", b + i);
  A[0] = B[0] = 0;
  int mi = 1000000000 + 6;
  for (int(i) = 1; (i) <= (n); ++(i)) {
    mozna[i] = 0;
    A[i] = A[i - 1] + a[i];
    B[i] = B[i - 1] + b[i];
    (mi) = min((mi), (A[i] - B[i]));
    ;
  }
  for (int(i) = 1; (i) <= (n); ++(i)) {
    int prev = i - 1;
    if (prev == 0) prev = n;
    if (A[prev] - B[prev] == mi) mozna[i] = 1;
  }
  for (int(i) = 1; (i) <= (n); ++(i)) ar[i] = a[n + 1 - i];
  for (int(i) = 1; (i) <= (n - 1); ++(i)) br[i] = b[n - i];
  br[n] = b[n];
  Ar[0] = Br[0] = 0;
  int mir = 1000000000 + 6;
  for (int(i) = 1; (i) <= (n); ++(i)) {
    Ar[i] = Ar[i - 1] + ar[i];
    Br[i] = Br[i - 1] + br[i];
    (mir) = min((mir), (Ar[i] - Br[i]));
    ;
  }
  for (int(i) = 1; (i) <= (n); ++(i)) {
    int prev = i - 1;
    if (prev == 0) prev = n;
    if (Ar[prev] - Br[prev] == mir) mozna[n + 1 - i] = 1;
  }
  pisz(count(mozna + 1, mozna + n + 1, 1));
  for (int(i) = 1; (i) <= (n); ++(i))
    if (mozna[i]) printf("%d ", i);
}
