#include <bits/stdc++.h>

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int N; std::cin >> N;
  std::vector<int> A(N), B(N - 1);
  for (int i = 0; i < N; i++) {
    std::cin >> A[i];
  }
  for (int i = 0; i + 1 < N; i++) {
    std::cin >> B[i];
  }
  std::sort(A.begin(), A.end());
  std::sort(B.begin(), B.end());
  std::vector<long long> L(N, 0), R(N, 0);
  for (int i = 0; i + 1 < N; i++) {
    L[i + 1] = L[i] + std::abs(A[i] - B[i]);
  }
  for (int i = N - 1; i > 0; i--) {
    R[i - 1] = R[i] + std::abs(A[i] - B[i - 1]);
  }
  long long ans = 1LL << 60;
  for (int i = 0; i < N; i++) {
    ans = std::min(ans, L[i] + R[i]);
  }
  std::vector<int> P;
  for (int i = 0; i < N; i++) {
    if (ans == L[i] + R[i]) {
      P.push_back(A[i]);
    }
  }
  std::sort(P.begin(), P.end());
  P.erase(std::unique(P.begin(), P.end()), P.end());
  std::cout << ans << '\n';
  for (int i = 0; i < (int)P.size(); i++) {
    std::cout << P[i] << (i + 1 == (int)P.size() ? '\n' : ' ');
  }
}