#include <bits/stdc++.h>
using namespace std;
#ifdef local
#include <debug.hpp>
#else
#define debug(...)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
template <class T> istream& operator>>(istream& I, vector<T>& V) {for (T& X : V) I >> X; return I;}
template <class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
template <class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
vector<int> di = {-1, 1, 0, 0}, dj = {0, 0, -1, 1}; int inf = 2e9; long INF = 1e18;

int main() {
    int n;
    cin >> n;
    vector<int> a(n), b(n - 1);
    cin >> a >> b;
    ranges::sort(a);
    ranges::sort(b);

    vector<long> fr(n), ba(n);
    rep(i, n - 1) fr[i + 1] = fr[i] + abs(a[i] - b[i]);
    rep(i, n - 1) ba[i + 1] = ba[i] + abs(a[n - i - 1] - b[n - i - 2]);
    
    long mn = INF;
    rep(i, n - 1) chmin(mn, fr[i] + ba[n - i - 1]);
    set<int> st;
    for (int i = 0; i < n; i++) {
        if (fr[i] + ba[n - i - 1] == mn) {
            st.insert(a[i]);
        }
    }
    cout << (int)st.size() << endl;
    vector<int> ans(st.begin(), st.end());
    rep(i, ans.size()) cout << ans[i] << " \n"[i == ans.size() - 1];
    return 0;
}