kefa and first step_ codeforces

#include<stdio.h>

int main()
{
    int n, a[100], i, countp=0;
    scanf("%d", &n);

    for(i=0;i<n;i++)
    {
        scanf("%d", &a[i]);
    }
    for(i=0;i<n;i++)
    {
        if(a[i]<a[i+1])
        {
            countp++;
        }
    }
    printf("%d\n", countp);

    return 0;
}