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

using namespace std;

int calculate_min_sadness(vector<int>& A, vector<int>& B, int skip_index) {
    int n = A.size();
    vector<int> temp_A;
    for (int i = 0; i < n; i++) {
        if (i != skip_index) temp_A.push_back(A[i]);
    }
    
    int total_sadness = 0;
    for (int i = 0; i < n - 1; i++) {
        total_sadness += abs(temp_A[i] - B[i]);
    }
    return total_sadness;
}

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++) {
        int sadness = calculate_min_sadness(A, B, i);
        if (sadness < min_sadness) {
            min_sadness = sadness;
            possible_lengths.clear();
            possible_lengths.push_back(A[i]);
        } else if (sadness == min_sadness) {
            possible_lengths.push_back(A[i]);
        }
    }
    sort( possible_lengths.begin(), possible_lengths.end() );
possible_lengths.erase( unique( possible_lengths.begin(), possible_lengths.end() ), possible_lengths.end() );
    cout << possible_lengths.size() << endl;
    for (int x : possible_lengths) cout << x << " ";
    cout << endl;
    return 0;
}