#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 3e5 + 60;
int bst[4 * N], n, a[N], b[N], c[N];
struct line {
	int k, n;
	int fun(int x) {
		return k * x + n;
	}
	long double inter(line l) {
		return (l.n - n) / (k - l.k);
	}
};
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n;
  	for (int i = 0;i <= n;i++)
  		cin >> a[i];
  	for (int i = 0;i <= n;i++)
  		cin >> b[i];
  	for (int i = 0;i <= n;i++)
  		cin >> c[i];
  	vector<long double> pts;
  	auto Build = [&](int x[]) {
  		deque<line> g;
  		for (int i = 0;i <= n;i++) {
  			line t = {i, x[i]};
  			while (g.size() >= 2 && t.inter(g[g.size() - 1]) <= t.inter(g[g.size() - 2]))
  				g.pop_back();
  			if (!g.empty()) 
  				pts.push_back(t.inter(g.back()));
  			g.push_back(t);
  		}
  		return g;
  	};
  	deque<line> ca = Build(a);
  	deque<line> cb = Build(b);
  	deque<line> cc = Build(c);
  	vector<int> ans;
  	int pr = ca[0].k + cb[0].k + cc[0].k;
  	pts.push_back(-3e9);
  	pts.push_back(3e9);
  	int mn = 1e9;
  	sort(pts.begin(), pts.end());
  	for (auto x : pts) {
  		while (ca.size() >= 2 && ca[0].fun(x) < ca[1].fun(x))
  			ca.pop_front();
  		while (cb.size() >= 2 && cb[0].fun(x) < cb[1].fun(x))
  			cb.pop_front();
  		while (cc.size() >= 2 && cc[0].fun(x) < cc[1].fun(x))
  			cc.pop_front();
  		int y = ca[0].k + cb[0].k + cc[0].k;
  		mn = min(mn, y);
  		bst[y] = 1;
  	}
  	for (int i = 0;i <= pr;i++) 
  		bst[i] = 1;
  	pr = ca[0].k + cb[0].k + cc[0].k;
  	for (int i = pr;i <= 3 * n;i++)
  		bst[i] = 1;
  	for (int i = 0;i <= 3 * n;i++) {
  		if (!bst[i])
  			ans.push_back(i);
  	}
  	cout << ans.size() << '\n';
  	for (auto u : ans)
  		cout << u << " ";
  }
  return 0;
}