✅ 정답 공개
nums=list(map(int,input().split()))
n=len(nums)
dp=[1]*n; prev=[-1]*n
for i in range(1,n):
for j in range(i):
if nums[j]<nums[i] and dp[j]+1>dp[i]:
dp[i]=dp[j]+1; prev[i]=j
max_len=max(dp); idx=dp.index(max_len)
path=[]
while idx!=-1: path.append(nums[idx]); idx=prev[idx]
print(*path[::-1])