#include<bits/stdc++.h>
#ifdef LOCAL
#define debug(...) printf(__VA_ARGS__)
#define edebug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#define edebug(...)
#endif
#define int ll
#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define nrep(i, x, y) for(int i = x; i >= y; --i)
#define ll long long
#define pii std::pair<int,int>
#define pb emplace_back
#define fi first
#define se second
template <class T> 
inline void ckmax(T &a, T b) {
  if(a < b) a = b;
}
template <class T> 
inline void ckmin(T &a, T b) {
  if(a > b) a = b;
}
auto rt_YES = []{puts("YES");};
auto rt_Yes = []{puts("Yes");};
auto rt_NO = []{puts("NO");};
auto rt_No = []{puts("No");};
namespace IO {
#define isdigit(x) (x >= '0' && x <= '9')
  inline char gc() {
    return getchar();
  }
  inline bool blank(char ch) {
    return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
  }
  template <class T>
  inline void read(T &x) {
    double tmp = 1;
    bool sign = 0;
    x = 0;
    char ch = gc();
    for(; !isdigit(ch); ch = gc())
      if(ch == '-') sign = 1;
    for(; isdigit(ch); ch = gc())
      x = x * 10 + (ch - '0');
    if(ch == '.')
      for(ch = gc(); isdigit(ch); ch = gc())
        tmp /= 10.0, x += tmp * (ch - '0');
    if(sign) x = -x;
  }
  inline void read(char *s) {
    char ch = gc();
    for(; blank(ch); ch = gc());
    for(; !blank(ch); ch = gc())
      *s++ = ch;
    *s = 0;
  }
  inline void read(char &c) {
    for(c = gc(); blank(c); c = gc());
  }
  inline void push(const char &c) {
    putchar(c);
  }
  template <class T>
  inline void print(T x) {
    if(x < 0) {
      x = -x;
      push('-');
    }
    static T sta[35];
    T top = 0;
    do {
      sta[top++] = x % 10;
      x /= 10;
    } while(x);
    while(top)
      push(sta[--top] + '0');
  }
  template <class T>
  inline void print(T x, char lastChar) {
    print(x);
    push(lastChar);
  }
}
using namespace IO;

int a[300010];
pii getInterSect(int x,int y){
  // xt+ax = yt+ay
  debug("%lld %lld %lld %lld\n",x,y,a[x],a[y]);
  return{a[y]-a[x],x-y};
}
struct node{
  int id,val,X,Y;
  node(int _id,int _val,int _X,int _Y):
    id(_id),val(_val),X(_X),Y(_Y){}
  bool operator<(node b){return X*b.Y<Y*b.X;}
};
std::vector<node>ans;
int f[300010],v[3];

signed main() {
  clock_t c1 = clock();
#ifdef LOCAL
  freopen("in.in", "r", stdin);
  freopen("out.out", "w", stdout);
#endif
//------------------------------------------------------------------

  int n;read(n);
  rep(i,0,2){
    std::stack<int>s;
    rep(j,0,n){
      read(a[j]);
      if(s.size()<2)s.emplace(j);
      else{
        while(s.size()>=2){
          int S=s.top();s.pop();
          int T=s.top();s.pop();
          pii A=getInterSect(S,j),B=getInterSect(S,T);
          // A.fi/A.se <= B.fi/B.se
          debug("%lld %lld %lld %lld %lld %lld %lld\n",T,S,j,A.fi,A.se,B.fi,B.se);
          if(A.se<0)A.se*=-1,A.fi*=-1;
          if(B.se<0)B.se*=-1,B.fi*=-1;
          if(A.fi*B.se<=A.se*B.fi)s.emplace(T);
          else{s.emplace(T);s.emplace(S);break;}
        }
        s.emplace(j);
      }
    }
    std::vector<int>A;
    while(!s.empty())A.pb(s.top()),s.pop();
    std::reverse(A.begin(),A.end());
    int len=A.size();
    ans.pb(i,0,-1e9,1);
    rep(j,1,len-1){
      pii I=getInterSect(A[j-1],A[j]);
      ans.pb(i,A[j],I.fi,I.se);
      debug("%lld %lld %lld %.2lf\n",i,A[j-1],A[j],I.fi*1.0/I.se);
    }
  }
  std::sort(ans.begin(),ans.end());
  int len=ans.size();
  rep(j,0,len-1){
    auto i=ans[j];
    v[i.id]=i.val;
    if(j!=len-1&&(i.X*ans[j+1].Y==i.Y*ans[j+1].X))continue;
    f[v[0]+v[1]+v[2]]=1;
  }
  std::vector<int>A;
  rep(i,0,n*3)if(!f[i])A.pb(i);
  print(A.size(),'\n');
  for(int i:A)print(i,' ');

//------------------------------------------------------------------
end:
  std::cerr << "Time : " << clock() - c1 << " ms" << std::endl;
  return 0;
}