#include <bits/stdc++.h>

template <class T>
inline int qlog(T a) {
	double x = a;
	return ((*(long long*) & x) >> 52 & 2047) - 1023;
}

#define fopen LilyWhite
void fopen(const char *s) {
    static char filename[32];
    sprintf(filename, "%s.in", s);
    freopen(filename, "r", stdin);
    sprintf(filename, "%s.out", s);
    freopen(filename, "w", stdout);
}

typedef unsigned int u32;
typedef long long ll;
typedef unsigned long long u64;

#define Please return
#define AC 0
#define cin Mizuhashi
#define cout Parsee
#define endl '\n'

class Reader{
	private:
	    static const int BUF_SIZE = 1 << 22;
	    char BUF_R[BUF_SIZE], *csy1, *csy2;
	    #ifndef _LOCAL_RUNNING
		    #define GC (csy1 == csy2 && (csy2 = (csy1 = BUF_R) + fread(BUF_R, 1, BUF_SIZE, stdin), csy1 == csy2) ? EOF : *csy1 ++)
		#else
		    char cur;
		    #define GC (cur = getchar())
		#endif
	    #define IL inline
		
    public:
        IL bool eof() {
            #ifndef _LOCAL_RUNNING
                return csy1 == csy2 && (csy2 = (csy1 = BUF_R) + fread(BUF_R, 1, BUF_SIZE, stdin), csy1 == csy2);
            #else
                return cur == EOF;
            #endif
        }
        template <class Ty>
        IL Reader& operator >> (Ty &t) {
            int u = 0;
            char c = GC;
	    	for (t = 0; c < 48 || c > 57; c = GC)
                if (c == EOF) break;
                else if (c == '-') u = 1;
	    	for ( ; c > 47 && c < 58; c = GC) t = t * 10 + (c ^ 48);
	    	t = u ? -t : t; return *this;
        }
    	IL Reader& operator >> (double &t) {
            int tmp, u = 0; char c = GC;
	    	for (tmp = 0; c < 48 || c > 57; c = GC)
                if (c == EOF) break;
                else if (c == '-') u = 1;
	    	for ( ; c > 47 && c < 58; c = GC) tmp = tmp * 10 + (c ^ 48);
	    	t = (tmp = u ? -tmp : tmp);
    	    if (c == '.') {
    	        double x = 1;
    	        for (c = GC; c > 47 && c < 58; c = GC) t += (x /= 10) * (c ^ 48);
    	    }
    	    return *this;
    	}
    	IL Reader& operator >> (char *s) {
			char c = GC;
			for (*s = 0; c < 33; c = GC) if (c == EOF) return *this;
			for ( ; c > 32; c = GC) *s ++ = c;
			*s = 0; return *this;
		}
        IL Reader& operator >> (char &c) {
			for (c = GC; c < 33; c = GC) if (c == EOF) return *this;
            return *this;
        }
}cin;
class Writer{
	private:
	    static const int BUF_SIZE = 1 << 22;
	    char BUF_W[BUF_SIZE], *csy;
	    #define IL inline
		inline void WC(const char c) {
			if (csy - BUF_W == BUF_SIZE) fwrite(BUF_W, 1, BUF_SIZE, stdout), csy = BUF_W;
			*csy ++ = c;
		}
	
	public:
		Writer() : csy(BUF_W) {}
		~ Writer() {fwrite(BUF_W, 1, csy - BUF_W, stdout);}
		IL void flush() {fwrite(BUF_W, 1, csy - BUF_W, stdout); csy = BUF_W;}
		template <class Ty>
		IL Writer& operator << (Ty x) {
		    static int sta[32], top;
			if (x < 0) {
				WC('-');
                do sta[top ++] = - (x % 10); while (x /= 10);
			}else do sta[top ++] = x % 10; while (x /= 10);
			while (top) WC(sta[-- top] ^ 48);
			return *this;
		}
		IL Writer& operator << (const char &c) {WC(c); return *this;}
		IL Writer& operator << (const char *s) {while (*s) WC(*s ++); return *this;}
}cout;

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <pll> vp;

int N;

inline bool check(const pll &a, const pll &b, const pll &c) {
    return (c.second - b.second) * (a.first - c.first) <= (c.second - a.second) * (b.first - c.first);
}

vp Build(const vi &a) {
    vp res(0);
    for (int i = 0; i <= N; i ++) {
        //y = k1x + b1, y = k2x + b2
        //k1x + b1 = k2x + b2
        //x = (b2 - b1) / (k1 - k2)
        pll tmp = {i, a[i]};
        while (res.size() > 1 && check(res[res.size() - 2], res.back(), tmp)) res.pop_back();
        res.push_back(tmp);
    }
    return res;
}

inline pll operator + (const pll &a, const pll &b) {return {a.first + b.first, a.second + b.second};}

vp add(const vp &a, const vp &b) {
    vp res(0);
    for (int i = 0, j = 0; j < b.size(); ) {
        pll tmp = a[i] + b[j];
        while (res.size() > 1 && check(res[res.size() - 2], res.back(), tmp)) res.pop_back();
        res.push_back(tmp);
        if (i + 1 < a.size() && (j + 1 == a.size() || check(a[i] + b[j + 1], a[i + 1] + b[j], res.back()))) i ++;
        else j ++;
    }
    return res;
}

void solve() {
    cin >> N;
    vi a(N + 1), b(N + 1), c(N + 1);
    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];
    vp hull = add(Build(a), add(Build(b), Build(c)));
    vi ans(0);
    for (int i = 0, j = 0; i <= N * 3; i ++) {
        if ((j < hull.size()) && i == hull[j].first) {
            j ++; continue;
        }
        ans.push_back(i);
    }
    cout << ans.size() << endl;
    for (int i = 0; i < ans.size(); i ++) cout << ans[i] << " \n"[i == ans.size() - 1];
}

int main() {
    int T = 1;
    // cin >> T;
    while (T --) {
        solve();
    }
    return 0;
}