//#define local
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#define MAXN 2002
using namespace std;
typedef long long ll;
bool compare(int &a,int &b,int &cheak){
if(cheak==0)
return a>b;//严格递增
else
return a>=b;
}
int count(vector<int>&origin,int cheak){
vector<int>d;
d.push_back(origin[0]);
for(int i=1;i<origin.size();++i){
if(compare(origin[i],d.back(),cheak))
d.push_back(origin[i]);
else{
vector<int>::iterator it;
if(cheak!=0)
it=upper_bound(d.begin(),d.end(),origin[i]);
else
it=lower_bound(d.begin(),d.end(),origin[i]);
if(it==d.end())
d.push_back(origin[i]);
else
d[it-d.begin()]=origin[i];
}
}
return (int)d.size();
}
int main(){
#ifdef local
freopen("data.in","rb",stdin);
//freopen("data.out","wb",stdout);
#endif
int tmp;
vector<int>origin;
while((scanf("%d",&tmp))==1){
origin.push_back(tmp);
}
int ans=count(origin,0);
reverse(origin.begin(),origin.end());
cout<<count(origin,1)<<endl;
cout<<ans;
return 0;
}
04-12
168

04-12
357
