import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
b = list(map(int,input().split()))
e = [(a[i],i) for i in range(n)]
e.sort()
a = [e[i][0] for i in range(n)]
f = [e[i][1] for i in range(n)]
b.sort()

ans = []
c = []
t = 0
for i in range(n-1):
    t += abs(a[i]-b[i])
    c.append(t)
d = [-1 for i in range(n)]
t = 0
for i in reversed(range(n-1)):
    t += abs(a[i+1]-b[i])
    d[i] = t
c.append(0)
d[-1] = 0
for i in range(n):
    z = c[i-1] + d[i]
    ans.append(z)

x = min(ans)
"""
print(ans)
print(a)
print(b)
print(c)
print(d)
"""
w = []
for i in range(n):
    if ans[i] == x:
        w.append(a[i])
        #print(f[i]+1)
w = list(set(w))
w.sort()
print(len(w))
print(*w)