import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

from bisect import bisect

n=II()
pp=LI()

lis=[]
dist=[0]*n
for i,p in enumerate(pp):
    j=bisect(lis,p)
    dist[i]=j
    if j==len(lis):
        lis.append(p)
    else:
        lis[j]=p

mx=len(lis)-1
lis=[]
ok=[]
idx=[]
for i in range(n)[::-1]:
    j=bisect(lis,-pp[i])
    if dist[i]+j!=mx:continue
    if j==len(lis):
        lis.append(-pp[i])
        ok.append(1)
    else:
        lis[j]=-pp[i]
        ok[j]=0

ans=[]
for p,j in zip(lis,ok):
    if j:ans.append(-p)

ans.reverse()
print(len(ans))
print(*ans)