#include <bits/stdc++.h>

typedef long long ll;
typedef std::pair<long long, long long> P;
typedef std::priority_queue<P, std::vector<P>, std::greater<P>> PQ;

int main()
{
    int n;
    std::cin >> n;
    std::vector<ll> a(n), b(n - 1);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n - 1; ++i) {
        std::cin >> b[i];
    }
    std::sort(a.begin(), a.end());
    std::sort(b.begin(), b.end());
    long long mi = 0;
    std::vector<long long> ans(n, 0);
    for (int i = 0; i < n - 1; ++i) {
        mi += abs(a[i] - b[i]);
    }
    ans[n - 1] = mi;
    ll cur = mi;
    for (int i = n - 2; i >= 0; --i) {
        cur -= abs(a[i] - b[i]);
        cur += abs(a[i + 1] - b[i]);
        mi = std::min(mi, cur);
        ans[i] = cur;
    }
    int count = 0;
    for (int i = 0; i < n; ++i) {
        if (ans[i] == mi && (i == 0 || a[i - 1] != a[i])) count++;
    }
    std::cout << count << std::endl;
    for (int i = 0; i < n; ++i) {
        if (ans[i] == mi && (i == 0 || a[i - 1] != a[i])) {
            std::cout << a[i];
            count--;
            if (count == 0) std::cout << std::endl;
            else std::cout << ' ';
        }
    }
}