#include<cstdio>
#include<vector>
#include<algorithm>
#define M 300005
#define int64 long long
using namespace std;
struct node{
	int x,y;
	node operator -(const node &_)const{
		return (node){x-_.x,y-_.y};
	}
};
bool mark[M*3];
int val[M];
vector<int>Ans;
vector<node>stk,All;
long long cross(node a,node b){
	return 1ll*a.x*b.y-1ll*a.y*b.x;
}
bool cmp(node x,node y){
	return cross(x,y)<0;
}
int main(){
	int n;
	scanf("%d",&n);
	int T=3;
	while(T--){
		stk.clear();
		for(int i=0;i<=n;i++){
			int x;
			scanf("%d",&x);
			node now=(node){i,x};
			while((int)stk.size()>1&&cross(stk[stk.size()-1]-stk[stk.size()-2],now-stk[stk.size()-2])>=0)stk.pop_back();
			stk.push_back(now);
		}
		All.push_back(stk[0]);
		for(int i=1;i<(int)stk.size();i++)All.push_back(stk[i]-stk[i-1]);
	}
	sort(All.begin(),All.end(),cmp);
	int res=0;
	for(int i=0;i<(int)All.size();i++){
		res+=All[i].x;
		if(i==(int)All.size()-1||cross(All[i],All[i+1])!=0)mark[res]=true;
	}
	for(int i=0;i<=3*n;i++)if(!mark[i])Ans.push_back(i);
	printf("%d\n",(int)Ans.size());
	for(int i=0;i<(int)Ans.size();i++)printf("%d ",Ans[i]);puts("");
	return 0;
}