//https://qoj.ac/contest/1382/problem/7569
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define PI acos(-1)
#define LSB(i) ((i) & -(i))
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define sc second
#define th third
#define fo fourth
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
#define INF 1e15
#define MOD 1000000007
#define endl "\n"

#define all(data)       data.begin(),data.end()
#define TYPEMAX(type)   std::numeric_limits<type>::max()
#define TYPEMIN(type)   std::numeric_limits<type>::min()
#define MAXN 300007
vector<ll> h[3];
ll n;
pll a[3][MAXN];
bool mm[3*MAXN];
vector<ll> Convex_Hull(pll b[])
{
	vector<ll> ch;
	for(int i=0;i<=n;i++)
    {
		while(ch.size()>=2 && b[ch[ch.size()-2]].fi-b[ch.back()].fi*(i-ch.back())>=(b[ch.back()].fi-b[i].fi)*(ch.back()-ch[ch.size()-2])) ch.pop_back();
		ch.pb(i);
	}
	return ch;
}
bool cmp(ll x,ll y)
{
	ll x1=h[x][h[x].size()-2],y1=h[x].back(),x2=h[y][h[y].size()-2],y2=h[y].back();
	if((a[x][x1].fi-a[x][y1].fi)*(y2-x2)<(a[y][x2].fi-a[y][y2].fi)*(y1-x1)) return true;
	return false;
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n; mm[3*n]=true;
	for(int i=0;i<3;i++)
    {
		for(int j=0;j<=n;j++) {cin>>a[i][j].fi; a[i][j].sc=j;}
		h[i]=Convex_Hull(a[i]);
	}
	while(true)
    {
		ll dd=0; bool check[3];
        for(int i=0;i<3;i++) check[i]=false;
		for(int i=0;i<3;i++)
        {
			if(h[i].size()==1) continue;
			bool checkk=true;
			for(int j=0;j<3;j++)
			{
				if(i==j || h[j].size()==1) continue;
				if(cmp(i,j)) checkk=false;
			}
			if(checkk) check[i]=true;
		}
		if(!check[0] && !check[1] && !check[2]) break;
		for(int i=0;i<3;i++)
		{
			if(check[i]) h[i].pop_back();
			dd+=h[i].back();
		}
		mm[dd]=true;
	}
	vector<ll> rez;
	for(int i=0;i<=3*n;i++)
	{
		if(!mm[i]) rez.pb(i);
	}
	cout<<rez.size()<<endl;
	for(auto dd:rez) cout<<dd<<" ";
	return 0;
}