#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define pb push_back
using namespace std;
const int N=4e5+20,M=1e6+20,mod=998244353;
struct Node{ll x,y;}stk[N],v1[N],v2[N],s1[N],s2[N],p[N],a[N],b[N],c[N];int top;
inline Node operator -(Node a,Node b){return (Node){a.x-b.x,a.y-b.y};}
inline Node operator +(Node a,Node b){return (Node){a.x+b.x,a.y+b.y};}
inline ll operator *(Node a,Node b){return a.x*b.y-a.y*b.x;}
struct Vec{ll x,y;}vec[N];
inline ll pw(ll x){return x*x;}
inline ll lens(Node a){return pw(a.x)+pw(a.y);}
inline ll Cross(Vec a,Vec b){return a.x*b.y-a.y*b.x;}
inline ll Side(Node a,Node b,Node c){Vec v1=(Vec){b.x-a.x,b.y-a.y};Vec v2=(Vec){c.x-b.x,c.y-b.y};return Cross(v1,v2);}
inline bool cmp(Node a,Node b){return a.x==b.x?a.y<b.y:a.x<b.x;}
inline bool cmp2(Node a,Node b){return a*b<0;}
void Andrew(Node* p,int& n){
	memset(stk,0,sizeof(stk));
	stk[1]=p[1];stk[2]=p[2];top=2;
	for(int i=3;i<=n;i++){
		while(top>1&&Side(stk[top-1],stk[top],p[i])>=0) top--;
		stk[++top]=p[i];
	}
	n=top;
	for(int i=1;i<=n;i++) p[i]=stk[i];
}
int cnt;
void Minkowski(Node* s1,Node* s2,Node* s3,int &n,int m,int k){
	vector<Node> v,res;v.clear();res.clear();
	for(int i=2;i<=n;i++) v.pb(s1[i]-s1[i-1]);
	for(int i=2;i<=m;i++) v.pb(s2[i]-s2[i-1]);
	for(int i=2;i<=k;i++) v.pb(s3[i]-s3[i-1]);
	sort(v.begin(),v.end(),cmp2);
	res.pb(s1[1]+s2[1]+s3[1]);
	for(auto u:v) res.pb(res.back()+u);
	n=res.size();
	for(int i=1;i<=n;i++) s1[i]=res[i-1];
}
int n,vis[N];
int len[3];
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;n++;
	len[0]=len[1]=len[2]=n;
	for(int i=1;i<=n;i++) a[i].x=i-1,cin>>a[i].y;
	for(int i=1;i<=n;i++) b[i].x=i-1,cin>>b[i].y;
	for(int i=1;i<=n;i++) c[i].x=i-1,cin>>c[i].y;
	Andrew(a,len[0]);Andrew(b,len[1]);Andrew(c,len[2]);
	Minkowski(a,b,c,len[0],len[1],len[2]);
	Andrew(a,len[0]);
	int cnt=0;
	for(int i=1;i<=len[0];i++) if(!vis[a[i].x]) cnt++,vis[a[i].x]=1;
	cout<<3*(n-1)+1-cnt<<'\n';
	for(int i=0;i<=3*(n-1);i++) if(!vis[i]) cout<<i<<' ';
	return 0;
}
/*
3
3 1 8 7
9 1 3 1
5 1 1 6
1
1 2
1 2
1 2
*/