#include<bits/stdc++.h> using namespace std; int n,a[10005],dp[10005],p[10005],ans,k,t; stack<int>s; string str; char ch; int main() { getline(cin,str); istringstream iss(str); while(iss>>a[++n]) { dp[n]=1; t=0; for(int j=1;j<n;j++) if(a[j]<a[n]&&dp[j]>t) t=dp[j],p[n]=j; dp[n]+=t; if(ans<dp[n]) ans=dp[n],k=n; } cout<<"max="<<ans<<endl; while(k) { s.push(a[k]); k=p[k]; } while(!s.empty()) { cout<<s.top()<<' '; s.pop(); } return 0; }