#include <bits/stdc++.h>
using namespace std;
int a[200010], b[200010], c[200010], second[200010], n;
bool vis[200010];
multiset<int> st;
void deal() {
  for (int i = 1; i <= 2 * n; i++) second[i] = second[i - 1] + a[i] - b[i];
  st.clear();
  for (int i = 1; i < n; i++) st.insert(second[i]);
  st.insert(0);
  for (int i = 1; i <= n; i++) {
    st.erase(st.find(second[i - 1]));
    st.insert(second[i + n - 1]);
    if (st.lower_bound(second[i - 1]) == st.begin()) vis[c[i]] = true;
  }
}
int main() {
  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);
  for (int i = n + 1; i <= 2 * n; i++) a[i] = a[i - n], b[i] = b[i - n];
  for (int i = 1; i <= n; i++) c[i] = i;
  deal();
  a[n + 1] = a[1], b[n + 1] = b[n];
  for (int i = n + 2; i <= 2 * n; i++)
    a[i] = a[2 * n - i + 2], b[i] = b[2 * n - i + 1];
  for (int i = 1; i <= n; i++) a[i] = a[i + n], b[i] = b[i + n];
  for (int i = 2; i <= n; i++) c[i] = n + 2 - i;
  deal();
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (vis[i]) ans++;
  printf("%d\n", ans);
  if (ans) {
    for (int i = 1; i <= n; i++)
      if (vis[i]) printf("%d ", i);
    printf("\n");
  }
  return 0;
}
