//一开始题目读错5 7 3 5 1 2输出地应该为2的,一开始题目读的认真,因为是求最大的连续的递减子序列
#include<iostream>//2313056 2010-04-08 17:47:13 Accepted 1257 15MS 348K 629 B C++ 悔惜晟
#include<algorithm>
using namespace std;
int num[100005];
int main()
{
int n, count, i;
int b[10005];
while(cin>>n)
{
if(n == 0)
{
cout<<"0"<<endl;
continue;
}
for(i = 1; i <= n; i++)
{
cin>>num[i];
b[i] = 1;
}
int j;
count = 0;
int max1;
for(i = 1; i <= n; )
{
max1 = 0x7fffffff;
for(j = 1; j <= n; j++)
{
if(num[j] < max1 && b[j] != -1)
{
b[j] = -1;
max1 = num[j];
i++;
}
}
count++;
}
//for(i = 1; i <= n; i++)
//if(b[i] != -1)
//count++;
cout<<count<<endl;
}
}