def q39(n, h):
    count = 1
    for i in range(1, n):
        if h[i - 1] <= h[i] and h[0] <= h[i]:
            count += 1
    return count
    #eturn count


N = int(input())
H = [int(i) for i in input().split()]
print(q39(N, H))