#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> A(n), B(n - 1);

    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());

    int min_sadness = INT_MAX;
    vector<int> possible_lengths;

    for (int i = 0; i < n; i++) {  // Try removing A[i] each time
        int sadness = 0, j = 0, k = 0;

        while (j < n && k < n - 1) {
            if (j == i) {  // Skip A[i]
                j++;
                continue;
            }
            sadness += abs(A[j] - B[k]);
            j++, k++;
        }

        if (sadness < min_sadness) {
            min_sadness = sadness;
            possible_lengths = {A[i]};
        } else if (sadness == min_sadness) {
            possible_lengths.push_back(A[i]);
        }
    }

    cout << possible_lengths.size() << endl;
    for (int x : possible_lengths) cout << x << " ";
    cout << endl;

    return 0;
}