#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using ll = long long;
using namespace std;
#define modP 998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;cin >> N;
    int A[200002], B[200002];
    for (int i = 0;i < N;i++) {
        cin >> A[i];
    }
    for (int i = 1;i < N;i++) {
        cin >> B[i-1];
    }
    sort(A, A + N);
    sort(B, B + N - 1);
    ll bad = 0;
    for (int i = 0;i < N-1;i++) {
        bad += abs(A[i] - B[i]);
    }
    ll ans[200002];
    ans[N - 1] = bad;
    for (int i = N - 2;i >= 0;i--) {
        bad += abs(A[i+1] - B[i]);
        bad -= abs(A[i] - B[i]);
        ans[i] = bad;
    }
    ll Mi = 1e18;
    for (int i = 0;i < N;i++) {
        Mi = min(Mi, ans[i]);
    }
    set<ll>Out;
    for (int i = 0;i < N;i++) {
        if (ans[i] == Mi)Out.insert(A[i]);
    }
    cout << Out.size() << endl;
    auto itr = Out.begin();
    while (itr != Out.end()) {
        cout << *itr << " ";
        itr++;
    }

    return 0;
}