#include<stdio.h>
#define N 10
struct TANGGUO{
int x;
int y;
}Tangguo[1024];
main()
{
int t;
for(t = 0; t < 1024; t++)
{
Tangguo[t].y = 0;
}
int i, j, k = 1;
int r = 0;
for(i = 0; i < N; i++)
{
scanf("%d", &Tangguo[i].x);
}
Tangguo[0].y = 1;
while(Tangguo[N-1].y == 0)
{
if(Tangguo[k].x < Tangguo[k-1].x)
{
Tangguo[k].y = 1;
if(k == 1)
{
Tangguo[k-1].y ++;
}
if(Tangguo[k-1].y == 1 && k >= 2)
{
Tangguo[k-1].y = 2;
for(r = k; r>1 ; r--)
{
if(Tangguo[r-1].y <= Tangguo[r-2].y)
{
Tangguo[r-2].y++;
}
else
{
break;
}
}
}
}
else if(Tangguo[k].x == Tangguo[k-1].x)
{
Tangguo[k].y = 1;
}
else
{
Tangguo[k].y = Tangguo[k-1].y+1;
}
k++;
}
int sum = 0;
for(i = 0; i < N; i++)
{
sum+= Tangguo[i].y;
}
printf("%d", sum);
return 0;
}
#define N 10
struct TANGGUO{
int x;
int y;
}Tangguo[1024];
main()
{
int t;
for(t = 0; t < 1024; t++)
{
Tangguo[t].y = 0;
}
int i, j, k = 1;
int r = 0;
for(i = 0; i < N; i++)
{
scanf("%d", &Tangguo[i].x);
}
Tangguo[0].y = 1;
while(Tangguo[N-1].y == 0)
{
if(Tangguo[k].x < Tangguo[k-1].x)
{
Tangguo[k].y = 1;
if(k == 1)
{
Tangguo[k-1].y ++;
}
if(Tangguo[k-1].y == 1 && k >= 2)
{
Tangguo[k-1].y = 2;
for(r = k; r>1 ; r--)
{
if(Tangguo[r-1].y <= Tangguo[r-2].y)
{
Tangguo[r-2].y++;
}
else
{
break;
}
}
}
}
else if(Tangguo[k].x == Tangguo[k-1].x)
{
Tangguo[k].y = 1;
}
else
{
Tangguo[k].y = Tangguo[k-1].y+1;
}
k++;
}
int sum = 0;
for(i = 0; i < N; i++)
{
sum+= Tangguo[i].y;
}
printf("%d", sum);
return 0;
}