#include using namespace std; int main() { int N; cin >> N; vector A(N), B(N-1); for (int i = 0; i < N; i++) { long long a; cin >> a; A.at(i) = a; } for (int i = 0; i < N-1; i++) { long long b; cin >> b; B.at(i) = b; } sort(A.begin(), A.end()); sort(B.begin(), B.end()); vector P(N-1); P.at(0) = abs(A.at(0) - B.at(0)); for (int i = 1; i < N-1; i++) { P.at(i) = P.at(i-1) + abs(A.at(i) - B.at(i)); } vector Q(N-1); Q.at(N-2) = abs(A.at(N-1) - B.at(N-2)); for (int i = N-3; i >= 0; i--) { Q.at(i) = Q.at(i+1) + abs(A.at(i+1) - B.at(i)); } vector I; long long complaint = Q.at(0); I.push_back(0); for (int i = 0; i < N-2; i++) { if (complaint > P.at(i) + Q.at(i + 1)) { I.clear(); complaint = P.at(i) + Q.at(i + 1); I.push_back(i + 1); } else if (complaint == P.at(i) + Q.at(i + 1)) { I.push_back(i + 1); } } if (complaint > P.at(N-2)) { I.clear(); I.push_back(N-1); } else if (complaint == P.at(N-2)) { I.push_back(N-1); } set length; for (int i : I) { length.insert(A.at(i)); } cout << length.size() << endl; for (auto value : length) { if (value != *begin(length)) cout << " "; cout << value; } cout << endl; }