#include<cstdio>
#include<algorithm>
using namespace std;
#define M 300005
#define int long long
struct node{
	int id,num;
	__int128 get_val(long long x){
		return (__int128)x*id+num;
	}
};
struct Cp{
	long long x,y;
	bool operator <(const Cp &_)const{
		return 1.0*x/y<1.0*_.x/_.y;
		return (__int128)x*_.y<(__int128)_.x*y;
	}
};
Cp Get_Pointx(node a,node b){
	return (Cp){b.num-a.num,a.id-b.id};
}
int n;
long long D[M<<3];
int sz_val;
struct solve_automation{
	int val[M];
	int sz,p;
	node stk[M];
	void Init(){
		p=1;sz=0;
		for(int i=0;i<=n;i++){
			node now=(node){i,val[i]};
			while(sz>1&&Get_Pointx(stk[sz-1],now)<Get_Pointx(stk[sz-1],stk[sz]))sz--;
			stk[++sz]=now;
		}
		for(int i=1;i<sz;i++){
			Cp tmp=Get_Pointx(stk[i],stk[i+1]);
			long long x=tmp.x/tmp.y;
			D[++sz_val]=x;
			D[++sz_val]=x-1;
			D[++sz_val]=x+1;
			D[++sz_val]=x+2;
			D[++sz_val]=x-2;
//			printf("x=%lld\n",x);
		}
//		for(int i=1;i<=sz;i++)printf("(%d %d) ",stk[i].id,stk[i].num);puts("");
	}
	int Get_val(long long x){
		while(p<sz&&stk[p].get_val(x)<stk[p+1].get_val(x))p++;
		if(p<sz&&stk[p].get_val(x)==stk[p+1].get_val(x))return -1;
		return stk[p].id;
	}
}A,B,C;
bool mark[M*3];
int Ans[M*3],sz;
signed main(){
//	freopen("data.in","r",stdin);
//	freopen("AC.out","w",stdout);
	scanf("%lld",&n);
	for(int i=0;i<=n;i++)scanf("%lld",&A.val[i]);
	for(int i=0;i<=n;i++)scanf("%lld",&B.val[i]);
	for(int i=0;i<=n;i++)scanf("%lld",&C.val[i]);
	A.Init();B.Init();C.Init();
//	D[++sz_val]=-2e9;
//	D[++sz_val]=2e9;
	sort(D+1,D+sz_val+1);
	sz_val=unique(D+1,D+sz_val+1)-D-1;
//	for(int i=1;i<=sz_val;i++)printf("%lld ",D[i]);puts("");
//	puts("Initok");
	for(int i=1;i<=sz_val;i++){
		int x=A.Get_val(D[i]),y=B.Get_val(D[i]),z=C.Get_val(D[i]);
		if(x==-1||y==-1||z==-1)continue;
//		printf("%lld %d %d %d\n",D[i],x,y,z);
		mark[x+y+z]=true;
	}
	for(int i=0;i<=3*n;i++)if(!mark[i])Ans[++sz]=i;
	printf("%lld\n",sz);
	for(int i=1;i<=sz;i++)printf("%lld ",Ans[i]);puts("");
	return 0;
}