#include <bits/stdc++.h>

const bool debug = false;
std::random_device seed;
std::mt19937 rng(seed());

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int tt = (debug ? 1e6 : 1);
  for (;tt--;) {
    int N;
    if (debug) {
      N = rng() % 8 + 1;
    } else {
      std::cin >> N;
    }
    std::vector<int> A(N), B(N - 1);
    for (int i = 0; i < N; i++) {
      if (debug) {
        A[i] = rng() % 10001 - 5000;
      } else {
        std::cin >> A[i];
      }
    }
    for (int i = 0; i + 1 < N; i++) {
      if (debug) {
        B[i] = rng() % 10001 - 5000;
      } else {
        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]);
    }
    // for (int i = 0; i < N; i++) {
    //   std::cout << L[i] << (i + 1 == N ? '\n' : ' ');
    // }
    // for (int i = 0; i < N; i++) {
    //   std::cout << R[i] << (i + 1 == N ? '\n' : ' ');
    // }
    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());
    if (debug) {
      long long naive = 1LL << 60;
      std::vector<int> P_naive;
      {//naive
        for (int i = 0; i < N; i++) {
          std::vector<int> A2;
          A2.reserve(N - 1);
          for (int j = 0; j < N; j++) {
            if (i != j) {
              A2.push_back(A[j]);
            }
          }
          do {
            long long tmp = 0;
            for (int j = 0; j + 1 < N; j++) {
              tmp += std::abs(A2[j] - B[j]);
            }
            naive = std::min(naive, tmp);
          } while (std::next_permutation(A2.begin(), A2.end()));
        }
        for (int i = 0; i < N; i++) {
          std::vector<int> A2;
          A2.reserve(N - 1);
          for (int j = 0; j < N; j++) {
            if (i != j) {
              A2.push_back(A[j]);
            }
          }
          bool fn = false;
          do {
            long long tmp = 0;
            for (int j = 0; j + 1 < N; j++) {
              tmp += std::abs(A2[j] - B[j]);
            }
            if (naive == tmp) {
              fn = true;
            }
          } while (std::next_permutation(A2.begin(), A2.end()));
          if (fn) {
            P_naive.push_back(A[i]);
          }
        }
        std::sort(P_naive.begin(), P_naive.end());
        P_naive.erase(unique(P_naive.begin(), P_naive.end()), P_naive.end());
      }
      if (ans != naive || P != P_naive) {
        std::cout << ans << '\n';
        for (auto v : P) {
          std::cout << v << ' ';
        }
        std::cout << '\n';
        std::cout << naive << '\n';
        for (auto v : P_naive) {
          std::cout << v << ' ';
        }
        std::cout << '\n';
        for (int i = 0; i < N; i++) {
          std::cout << A[i] << (i + 1 == N ? '\n' : ' ');
        }
        for (int i = 0; i < N; i++) {
          std::cout << B[i] << (i + 1 == N ? '\n' : ' ');
        }
        exit(0);
      } else {
        std::cout << "AC\n";
      }
    } else {
      // std::cout << ans << '\n';
      std::cout << P.size() << '\n';
      for (int i = 0; i < (int)P.size(); i++) {
        std::cout << P[i] << (i + 1 == (int)P.size() ? '\n' : ' ');
      }
    }
  }
}