from heapq import heappop, heappush, heapify
from bisect import bisect
#from sortedcontainers import SortedList
from collections import deque, defaultdict
from math import floor, ceil, isqrt, comb
from sys import stdin, setrecursionlimit
#setrecursionlimit(10**7)
intin = lambda: int(stdin.readline())
strin = lambda: stdin.readline().rstrip()
listin = lambda: list(map(int, stdin.readline().split()))
tuplein = lambda m: [tuple(map(lambda x: int(x) if x.isdigit() or (len(x) > 1 and x[0] == "-" and x[1:].isdigit()) else x, stdin.readline().split())) for _ in range(m)]
gridin = lambda m: [list(map(int, stdin.readline().split())) for _ in range(m)]
strgridin = lambda h: [stdin.readline().rstrip() for _ in range(h)]
mapin = lambda: map(int, stdin.readline().split())
N = intin()
A = listin()
B = listin()
ans = set()
tmp = 0
A.sort(); B.sort()
for a, b in zip(A[1:], B):
    tmp += abs(a - b)
ans.add(A[0])
minimum = tmp
for i in range(1, N):
    tmp -= abs(A[i] - B[i-1])
    tmp += abs(A[i-1] - B[i-1])
    if minimum > tmp:
        minimum = tmp
        ans = {A[i]}
    elif minimum == tmp:
        ans.add(A[i])
print(len(ans))
print(*sorted(list(ans)))