#include <bits/stdc++.h>

using namespace std;

struct line {
    int a;
    int b;
};

pair<int, int> intersect(line a, line b) { return {b.b - a.b, a.a - b.a}; }

struct event {
    pair<int, int> time;
    int line_type;
    int line_index;
};

const int N = 3e5 + 10;
int n;
int a[3][N];
line lines[3][N];
vector<event> events;

bool ltoe(pair<int, int> a, pair<int, int> b) {
    if(a.second == 0) return true;
    if(b.second == 0) return false;
    if((a.second < 0) == (b.second < 0)) return a.first * b.second <= b.first * a.second;
    return a.first * b.second >= b.first * a.second;
}

bool lt(pair<int, int> a, pair<int, int> b) {
    if(a.second == 0) return true;
    if(b.second == 0) return false;
    if((a.second < 0) == (b.second < 0)) return a.first * b.second < b.first * a.second;
    return a.first * b.second > b.first * a.second;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for(int i = 0; i < 3; i++) for(int j = 0; j <= n; j++) cin >> a[i][j];
    for(int i = 0; i < 3; i++) {
        for(int j = 0; j <= n; j++) {
            lines[i][j].a = j;
            lines[i][j].b = a[i][j];
        }
    }
    for(int i = 0; i < 3; i++) {
        sort(lines[i], lines[i] + n + 1, [&](line p, line q) {
            if(p.a == q.a) return p.b < q.b;
            return p.a < q.a;
        });
    }
    for(int t = 0; t < 3; t++) {
        vector<line> stk;
        for(int i = 0; i <= n; i++) {
            while(stk.size() > 1) {
                if(lines[t][i].a == stk.back().a) {
                    stk.pop_back();
                    continue;
                }
                pair<int, int> lst = intersect(lines[t][i], stk.back());
                pair<int, int> prv = intersect(stk.back(), stk[stk.size() - 2]);
                if(ltoe(lst, prv)) stk.pop_back();
                else break;
            }
            stk.push_back(lines[t][i]);
        }
        while(stk.size() > 1) {
            events.push_back({intersect(stk.back(), stk[stk.size() - 2]), t, stk.back().a});
            stk.pop_back();
        }
        events.push_back({{1, 0}, t, stk.back().a});
    }
    sort(events.begin(), events.end(), [&](event i, event j) { return lt(i.time, j.time); });
//    for(event e : events) {
//        cout << e.time.first << " " << e.time.second << " " << e.line_type << " " << e.line_index << "\n";
//    }
    vector<int> curr(3, -1);
    vector<bool> ok(3 * n + 1, false);
    for(int i = 0; i < 3; i++) {
        curr[events[i].line_type] = events[i].line_index;
        assert(events[i].time == make_pair(1, 0));
    }
    for(int i = 3; i < events.size(); i++) {
        if(events[i].time != events[i - 1].time) ok[curr[0] + curr[1] + curr[2]] = true;
        curr[events[i].line_type] = events[i].line_index;
    }
    ok[curr[0] + curr[1] + curr[2]] = true;
    vector<int> ans;
    for(int i = 0; i <= 3 * n; i++) if(!ok[i]) ans.push_back(i);
    cout << ans.size() << "\n";
    for(int i : ans) cout << i << " ";
    return 0;
}
/*

3
3 1 8 7
9 1 3 1
5 1 1 6

*/