#include <bits/stdc++.h>
using namespace std;

int main() {
    int n = 0;
    cin >> n;
    vector<int> a(n,0),b(n - 1,0);
    for (int i = 0;i < n;i++) {
        cin >> a[i];
    } 
    for (int i = 0;i < n - 1;i++) {
        cin >> b[i];
    }
    sort(a.begin(),a.end()); sort(b.begin(),b.end());
    vector<int> r(n,0);
    int temp1 = 0,temp2 = 0;
    for (int i = n - 1;1 <= i;i--) {
        r[i] = temp2;
        temp2 += abs(a[i] - b[i - 1]);
    }
    r[0] = temp2;
    int min_ = INT_MAX;
    set<int> ans = {};
    for (int i = 0;i < n;i++) {
        if (min_ > temp1 + r[i]) {
            ans.clear();
            ans.insert(a[i]);
            min_ = temp1 + r[i];
        } else if (min_ == temp1 + r[i]) {
            //cout << i << endl;
            ans.insert(a[i]);
        }
        //cout << temp1 << " " <<  r[i] << endl;
        if (i != n - 1) {
            temp1 += abs(a[i] - b[i]);
        }
    }
    cout << ans.size() << endl;
    for (int i : ans) {
        cout << i << " ";
    }
    cout << endl;
}