#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<ll,int>> a(n);
    vector<ll> b(n-1);
    rep(i,n) cin >> a[i].first, a[i].second = i+1;
    rep(i,n-1) cin >> b[i];
    sort(all(a));
    sort(all(b));
    set<int> ans;
    ll mi = INFLL;
    vector<ll> l(n), r(n);
    l[0] = r[n-1] = 0;
    rep(i,n-1) l[i+1] = l[i] + abs(a[i].first-b[i]);
    rep(i,n-1) r[n-2-i] = r[n-1-i] + abs(a[n-1-i].first-b[n-2-i]);
    rep(i,n){
        if(chmin(mi, l[i]+r[i])) ans.clear();
        if(mi==l[i]+r[i]) ans.insert(a[i].first);
    }
    cout << ans.size() << '\n';
    for(int x:ans) cout << x << " ";
    cout << '\n';
    return 0;
}