from bisect import *

INF = 10 ** 9
def lis(x):
    dp = [INF] * (len(x) + 1)
    id = [0] * len(x)
    for i in range(len(x)):
        id[i] = bisect_left(dp, x[i])
        dp[bisect_left(dp, x[i])] = x[i]
    m = max(id)
    b = [0] * (m + 1)
    for i in range(len(x) - 1, -1, -1):
        if id[i] == m:
            b[m] = x[i]
            m -= 1
    return bisect_left(dp, INF), b
def lds(x):
    l = []
    for i in x:
        l.append(-i)
    return lis(l)

n = int(input())
p = list(map(int, input().split()))
leng, lis_min = lis(p)
_, lis_max = lds(p[::-1])
lis_max = [-i for i in lis_max][::-1]
ans = []
for i in range(len(lis_min)):
    if lis_min[i] == lis_max[i]: ans.append(lis_min[i])
print(len(ans))
print(*ans)