def readints():
  return list(map(int, input().split()))

def deep_recursion():
  import sys
  import pypyjit  # type: ignore
  sys.setrecursionlimit(550000)
  pypyjit.set_param('max_unroll_recursion=-1')

def main():
  N = int(input())
  A = readints()
  B = readints()
  A = sorted(A)
  B = sorted(B)
  diff = mindiff = sum(abs(a-b) for a, b in zip(A[1:], B))
  ans = {A[0]}
  for i in range(1, N):
    diff = diff - abs(A[i]-B[i-1]) + abs(A[i-1]-B[i-1])
    if diff == mindiff:
      ans.add(A[i])
    elif diff < mindiff:
      mindiff = diff
      ans = {A[i]}
  print(len(ans))
  print(*sorted(ans))


if __name__ == '__main__':
  # deep_recursion()
  main()