Problem:
 Score : 200 points    Problem Statement There are N mountains ranging from east to west, and an ocean to the west.  At the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.  The height of the i -th mountain from the west is H_i .  You can certainly see the ocean from the inn at the top of the westmost mountain.  For the inn at the top of the i -th mountain from the west (i = 2, 3, ..., N) , you can see the ocean if and only if H_1 \leq H_i , H_2 \leq H_i , ... , and H_{i-1} \leq H_i .  From how many of these N inns can you see the ocean?      Constraints  All values in input are integers.  1 \leq N \leq 20  1 \leq H_i \leq 100         Input Input is given from Standard Input in the following format:  N  H_1  H_2  ...  H_N       Output Print the number of inns from which you can see the ocean.        Sample Input 1 4
6 5 6 8      Sample Output 1 3  You can see the ocean from the first, third and fourth inns from the west.       Sample Input 2 5
4 5 3 5 4      Sample Output 2 3       Sample Input 3 5
9 5 6 8 4      Sample Output 3 1

Solution (Python):
a=int(input())
p=list(map(int,input().split()))
n=0

for i in range(a):
  if max(p[:i+1]) == p[i]:
    n += 1
    
print(n)

Solution (Python):
N = int(input())
HEIGHTS = list(map(int, input().split()))
result = 0

for i in range(N):
    if HEIGHTS[i] == max(HEIGHTS[:i+1]):
        result += 1
    else:
        continue

print(result)

Solution (Python):
l = int(input())
tmp = list(map(int, input().split()))

ans = 0

for i in range(0, len(tmp)):
    if tmp[i] >= max(tmp[:i+1]):
        ans += 1

print(ans)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
t = 0
m = a[t]
for x in a:
    if x == m:
        t = t+1
    elif x > m:
        t = t+1
        m = x

print(t)

Solution (Python):
N=int(input())
H=[int(h) for h in input().split()]

Hmax=H[0]
count=1
for i in range(1,N):
    if Hmax<=H[i]:
        count+=1
        Hmax=H[i]
print(count)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
t = 0
m = a[0]
for x in a:
    if x == m:
        t += 1
    elif x > m:
        t += 1
        m = x

print(t)

Solution (Python):
N = int(input())
H = [int(h) for h in input().split()]


cnt = 0
for i in range(N):
    isSucces = True
    for j in range(i):
        if H[j] > H[i]:
            isSucces = False
            break
    if isSucces:
        cnt += 1

print(cnt)

Solution (Python):
n = int(input())
h_para = [int(i) for i in input().split()]

able_h = []
for i in range(n):
    count = 0
   

    

    for j in range(i):
        if h_para[i] >= h_para[j] :
            count = count
        else :
            count += 1
    if count == 0 : able_h.append(i)

print(len(able_h))

Solution (Python):
N = int(input())
H = [int(h) for h in input().split()]
maxh = H[0]
cnt = 1
for i in range(1, N):
    if H[i] >= maxh:
        cnt += 1
        maxh = H[i]
print(cnt)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

ans = 1 
for i in range(1,N):
    if H[i] >= max(H[:i]):
        ans += 1
print(ans)

Solution (Python):
n = int(input())
h = list(map(int,input().split()))
count = 0
for i in range(n):
    done = True
    for j in range(i):
        if h[j]>h[i]:
            done = False
    if done:
        count +=1
print(count)

Solution (Python):
nn = int(input())
hh = list(map(int, input().split()))
aa = 0

for ii in range(nn):
    mm = max(hh[:ii+1])
    if mm == hh[ii]:
        aa += 1
    
print(aa)

Solution (Python):
N = int(input())
H = [int(i) for i in input().split()]

ans = 1
for i in range(1, N):
    if H[i] >= max(H[:i]):
        ans += 1
print(ans)

Solution (Python):
a = int(input())
x = list(map(int,input().split()))
m = x[0]
s = 0
for i in range(1,a):
  if m <= x[i]:
    m = x[i]
    s+=1
print(s+1)

Solution (Python):


def main():
    N = int(input())
    H = list(map(int, input().split()))
    num = 0
    border = 0
    for i in range(N):
        if H[i] - border >= 0:
            num += 1
            border = H[i]

    print(num)

if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

ans = 1
for i in range(1, N):
    if max(H[:i]) <= H[i]:
        ans += 1

print(ans)

Solution (Python):

n = int(input())
hs = tuple(int(i) for i in input().split())

count = 0
for i, h in enumerate(hs):
    if all(hh <= h for hh in hs[:i]):
        count += 1

print(count)

Solution (Python):
from sys import stdin

N = int(stdin.readline().rstrip())
data = [int(x) for x in stdin.readline().rstrip().split()]

ans = 0
f = False
for i in range(N):
    for j in range(i):
        if data[j] > data[i]:
            f = True
    if not f:
        ans += 1
    f = False

print(ans)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))
cnt = 1
hmax = [0] * n
hmax[0] = h[0]
for i in range(1, n):
    hmax[i] = max(hmax[i - 1], h[i])
    if hmax[i] == h[i]:
        cnt +=1
print(cnt)

Solution (Python):


n = int(input())
l = list(map(int, input().split()))

x = 0
for i in range(len(l)):
    if l[i] == max(l[:i+1]):
        x += 1

print(x)

Solution (Python):
n = int(input())
h = [int(i) for i in input().split()]

s = 1
mount_max = -1
for i in range(1,n):
    mount_max = max(mount_max, h[i-1])
    if mount_max <= h[i]:
        s += 1
print(s)

Solution (Python):
n = int(input())
*h, = map(int, input().split())
ans = sum([1 if h[i]==max(h[:i+1]) else 0 for i in range(n)])
print(ans)

Solution (Python):
n = int(input())
h = list(map(int,input().split()))

ans = 0
H = h[0]

for i in range(n):
    if H <= h[i]:
        ans += 1
        H = h[i]
print(ans)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))
cnt = []
max = 0
for i in range(n):
  if h[i] >= max:
    max = h[i]
    cnt.append(h[i])
print(len(cnt))

Solution (Python):
n = int(input())
h = list(map(int,input().split()))
ans = 0
for i in range(n):
    temp_max = 0
    judge = True
    for j in range(i):
        if h[i] < h[j]:
            judge = False
    if judge:
        ans += 1
print(ans)

Solution (Python):

n = int(input())
h = list(map(int, input().split()))


ans = 0
maxHeight = 0

for i in range(0, n):
	if h[i] >= maxHeight:
		maxHeight = h[i]
		ans += 1
  
print(ans)

Solution (Python):
m=int(input())
a=list(map(int,input().split()))
D=1
n=1

while n < m:
 if a[n] < max(a[0:n]):
  D=D 
  n=n+1
 else:
  D=D+1 
  n=n+1

print(D)

Solution (Python):
N=int(input())
H=list(map(int,input().split()))


Max=0
count=0
for i in range(N):
    if H[i]>=Max:
        Max=H[i]
        count+=1
print(count)

Solution (Python):
N=int(input())
a=list(input().split())
sum=1
most=0
for i in range(N-1):
    most=max(int(a[i]),most)
    if most<=int(a[i+1]):
        sum+=1
print(sum)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))

ans = 1
height = h[0]
for i in range(n-1):
    if height <= h[i+1]:
        ans += 1
        height = h[i+1] 
    

print(ans)

Solution (Python):
n = int(input())
h = [int(i) for i in input().split()]

t = -1
ans = 0

for i in h:
    if t <= i:
       ans += 1
       t = i

print(ans)

Solution (Python):
N=int(input())
H = list(map(int,input().split()))
max=H[0]
count=0

for i in H:
    if i>=max:
        max=i
        count=count+1

print(count)

Solution (Python):
n = int(input())
h = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
  if h[i] == max(h[:i+1]):
    cnt += 1
print(cnt)

Solution (Python):
N = int(input())
nums = list(map(int, input().split()))
 
maxx = 0
count = 0
for n in nums:
    if n>=maxx:
        maxx = n
        count += 1
 
print(count)

Solution (Python):
N=int(input())
H= [int(h) for h in input().split()]
Hmax=[]
for n in range(N):
    Hmax.append(max(hi for i,hi in enumerate(H) if i<=n))


print(sum(Hmax[i]<=H[i] for i in range(N)))

Solution (Python):
n = int(input())
h = [int(i) for i in input().split()]

counter = 0
imax = 0

for i in range(n):
    if h[i] >= imax:
        counter += 1
        imax = h[i]


print(counter)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))
count = 1;
for i in range(1, len(h)):
    if max(h[:i]) <= h[i]:
        count += 1
print(count)

Solution (Python):
n=int(input())
h=list(map(int,input().split()))
mh = 0
ans = 0
for i in range(n):
    if mh <= h[i]:
        ans += 1
        mh = h[i]
print(ans)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))

L = [0] * N
L[0] = H[0]

count = 1
for i in range(1,N):
	L[i] = max(L[i-1],H[i])
	if L[i-1] <= H[i]:
		count += 1

print (count)

Solution (Python):
N=int(input())
H=input().split()
H=[int(i) for i in H]
cnt=1
key=False

for i in range(N):
    for j in range(i):
        if H[i]<H[j]:
            key=False
            break
        else:
            key=True
    if key==True:
        cnt+=1
    key=False
    
print(cnt)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))
cnt = 1
for i in range(1,N):
    if H[i] >= max(H[:i]):
        cnt += 1
print(cnt)

Solution (Python):
N = int(input())
H = [0]*N
H = input().split()
H = [int(h) for h in H]
for i in range(0, N-1):
    for j in range(i+1, N):
        if H[i] > H[j]:
            H[j] = 0
H = [h!=0 for h in H]
print(sum(H))

Solution (Python):
n=int(input())
h=list(map(int,input().split()))
res=1
for i in range(1,n):
    if max(h[:i])<=h[i]:
        res+=1
print(res)

Solution (Python):
n = int(input())
hs = list(map(int, input().split()))

count = 0
v_max = 0

for h in hs:
  if v_max <=h:
    count += 1
    v_max = h
print(count)

Solution (Python):
a=int(input())
List=list(map(int,input().split()))
c = 0

for i in range(a):
    if max(List[:i+1]) == List[i]:
        c +=1
print(c)

Solution (Python):
n = int(input())
H_list = list(map(int, input().split()))

sub = 0
ans = 0
for i in range(n):
    if(sub <= H_list[i]):
        sub = max(H_list[i], sub)
        ans += 1

print(ans)

Solution (Python):
n = int(input())
h = [int(i) for i in input().split()]
count = 0

for i in range(n):
	if max(h[0:i+1])==h[i]:
		count += 1
		
print(count)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))

ans = 1
ml = []

for i in range(n-1):
    ml.append(h[i])
    if h[i + 1] >= max(ml):
        ans += 1

print(ans)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))

h_max = 0
ans = 0
for i in range(n):
    if h[i] >= h_max:
        ans += 1
        h_max = h[i]
print(ans)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

cnt = 0
for i in range(len(H)):
    if(max(H[:i+1]) == H[i]):
        cnt += 1
print(cnt)

Solution (Python):
N=int(input())
H=list(map(int,input().split()))
max=H[0]
cnt=0
for i in H:
    if i>=max:
        max=i
        cnt+=1
print(cnt)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))
M = H[0]
ans = 0
for i in range(N):
    if M <= H[i]:
        M = H[i]
        ans += 1
print(ans)

Solution (Python):
n = int(input())
A = list(map(int ,input().split()))
ans = 0
maxA = 0
for i in range(n):
    if(A[i] >= maxA):
        maxA = A[i]
        ans += 1
print(ans)

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline() for _ in range(n)]
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main(N, H):
    n = 0
    h = 0
    for i in range(N):
        if h <= H[i]:
            n += 1
            h = H[i]
    print(n)

N = i2n()
H = i2nn()
main(N, H)

Solution (Python):
input();h = [int(s) for s in input().split()]
r=0
for i in range(len(h)):
    if max(h[:i+1])==h[i]:
        r+=1
print(r)

Solution (Python):
N =int(input())
H =[int(i) for i in input().split()]

maxhight=H[0]
answer=1
for i in range(1,N):
  if H[i]>=maxhight:
    answer=answer+1
    maxhight=H[i]
print(answer)

Solution (Python):
n=int(input())
h=list(map(int,input().split()))
hst=h[0]
cnt=1
for i in range(1,n):
    if h[i]>=hst:
        hst=h[i]
        cnt+=1
print(cnt)

Solution (Python):

if __name__ == "__main__":
    n = int(input())
    h = list(map(int, input().split()))
    hlim = 0
    count = 0
    for hotel in h:
        if hotel >= hlim:
            hlim = hotel
            count += 1
        else:
            pass
    print(count)

Solution (Python):
n = int(input())
h = list(map(int,input().split()))
height = h[0]
cnt = 0
for i in h:
    if i >= height:
        cnt = cnt + 1
        height = i
print(cnt)

Solution (Python):
N = int(input())
H_arr = list(map(int, input().split()))

tmp = H_arr[0]
ans = 1
for i in range(1,N):
    if H_arr[i] < tmp:
        pass
    else:
        tmp = H_arr[i]
        ans += 1

print(ans)

Solution (Python):
n = int(input())
h_list = [int(i) for i in input().split()]

count = 0
for i in range(len(h_list)):
    if max(h_list[:i+1]) == h_list[i]:
        count += 1
print(count)

Solution (Python):
s = int(input())
List=list(map(int,input().split()))
a = 0
b=List[0]
for i in range(s):
    if b <= List[i]:
        a +=1
        b = List[i]

print(a)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))
mx = H[0]
ans = 0
for h in H:
  if h >= mx:
    ans += 1
    mx = h
print(ans)

Solution (Python):
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from math import ceil, floor
from sys import setrecursionlimit

import heapq
import itertools
import operator



inf = float('inf')
N = 0


def set_inputs():
    global N
    return


def main():
    setrecursionlimit(100000)
    set_inputs()
    
    n = get_int()
    h = get_li()
    highest = 0
    ans = 0
    for hi in h:
        if hi >= highest:
            ans += 1
            highest = hi
    print(ans)
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def get_data(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().split(sep=sep))]
        for _ in range(n)
    )))


if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    ryokans = list(map(lambda x: int(x), input().split()))

    answer = 0
    for i in range(n):
        ryokans_before_target = ryokans[:i+1]
        highest_indexes = [i for i, x in enumerate(ryokans_before_target) if x == max(ryokans_before_target)]

        if i in highest_indexes:
            answer += 1
    
    print(answer)

Solution (Python):
N=int(input())
H=list(map(int,input().split()))
x=1
for i in range(1,N):
    is_count=True
    for j in range(i):
        if H[j] > H[i]:
            is_count=False
            break
    if is_count:
        x+=1
print(x)

Solution (Python):
c=0
m=0
n=int(input())
a=input().split()
for i in range(n):
	if int(a[i])>=m:
		c+=1
		m=int(a[i])
print(c)

Solution (Python):
n=int(input())
heights=list(map(int,input().split()))


cnt=0
maxH=0

for height in heights:
    if maxH<=height:
        maxH=height
        cnt+=1

print(cnt)

Solution (Python):
n = input()
arr = list(map(int,input().split(" ")))

m = arr[0]
ans = 0
for a in arr:
  if a>=m: 
    ans += 1
    m = a
print(ans)

Solution (Python):
count = int(input())
m = 0
c = 0
vals = input().split(" ")
for i in vals:
  val = int(i)
  m = max(m, val)
  if val >= m:
    c = c + 1
print(c)

Solution (Python):


a = int(input())

l = list(map(int, input().split()))


cnt = 1
for i, v in enumerate(l):
  if i >= 1:
    
    
    if max(l[:i]) <= v:
      cnt += 1

print(cnt)

Solution (Python):
a=input()
b=c=0
for i in map(int,input().split()):
    if b<=i:
        b=i
        c+=1
print(c)

Solution (Python):
c = 0
mx = 0
n = int(input())
l = list(map(int,input().split()))
for i in range(len(l)):
    if(l[i]>=mx):
        c+=1
    mx = max(mx,l[i])
print(c)

Solution (Python):
n=int(input())
h=list(map(int,input().split()))
print(sum(max(h[:i]+[0])<=h[i]for i in range(n)))

Solution (Python):
N = int(input())
Hs = list(map(int,input().split()))
Max = 0
number = 0
for i in range(N):
  if Max <= Hs[i]:
    Max = Hs[i]
    number += 1
print(number)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=1
for i in range(n-1):
    maxim=max(a[0:i+1])
    if a[i+1]>=maxim:
        ans+=1
print(ans)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))
ans = 1
for i in range(1,N):
  if H[i]>=max(H[:i]):
    ans += 1
print(ans)

Solution (Python):
N=int(input().split()[0])
H=list(map(int, input().split()))

cnt = 0
for i, h in enumerate(H):
  if(max(H[0:i+1]) <= h):
    cnt+=1

print(cnt)

Solution (Python):
n = int(input())
heights= list(map(int, input().split()))

cnt = 0
maxH = 0

for height in heights:
    if maxH <= height:
        maxH = height
        cnt += 1


print(cnt)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

m = 0  
re = 0
for i in range(N):
    if m <= H[i]:
        re += 1
        m = H[i]
        
print(re)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))

ret = 0
for i in range(n):
    for j in range(i):
        if h[i] < h[j]:
            break
    else:
        ret += 1
print(ret)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

pre = 0
ans = 0
for i in H:
    if i >= pre:
        ans += 1
        pre = i

print(ans)

Solution (Python):
N = int(input())
L = list(map(int, input().split()))
ans = 0
for i in range(N):
  if max(L[:i+1]) == L[i]:
    ans += 1
print(ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
sum=1
temp=a[0]
for i in range(n-1):
  if temp<=a[i+1]:
    temp=a[i+1]
    sum+=1
print(sum)

Solution (Python):
import numpy as np

N = int(input())
l = input().split()
l = np.array(l)
l = l.astype(int)
count = 1
for i in range(1, len(l)):
    if np.max(l[:i]) <= l[i]:
        count += 1
print(count)

Solution (Python):
n = int(input())

li_h = list(map(int, input().split()))

max_height = li_h[0]
counter = 1

for i in range(1, n):
    if max_height <= li_h[i]:
        counter += 1
    max_height = max(max_height, li_h[i])

print(counter)

Solution (Python):
n=int(input())
lst = list(map(int,input().split()))
maxv=lst[0]
ans=1
for i in range(1,n):
    if lst[i]>=maxv:
        ans+=1
        maxv=lst[i]
print(ans)

Solution (Python):
ans = 0
highest_mountain =-1
flag = 0

N = int(input())
h = list(map(int,input().split()))

for i in range(N):
    if (highest_mountain <= h[i]):
        
        highest_mountain =h[i]
        ans +=1
    
        

print(ans)

Solution (Python):
n=int(input())
h=list(map(int,input().split()))
ans=1
for i in range(1,n):
    if max(h[0:i])<=h[i]:
      ans+=1
print(ans)

Solution (Python):
length = int(raw_input())
M = map(int, raw_input().split())

count = 0
h = 0

for m in M:
    if int(m) >= h:
        count = count + 1
        h = m 
print(count)

Solution (Python):
n = int(input())
h = map(int, input().split())
a = 0
b = 0
for i in h:
  if b <= i:
    b = i
    a += 1
print(a)

Solution (Python):
import numpy as np

n = int(input())
a = input().split()
a = list(map(int,a))



count =0
x = 0




for i in a:
  if x <= i:
    x = max(x,i)
    count +=1
    
print(count)

Solution (Python):
N=int(input())
H=map(int,input().split())
m=0
c=0
for h in H:
  c += 1 if h>=m else 0
  m=max(m,h)
print(c)

Solution (Python):
num = int(input())
heights = list(map(int,input().split()))
cnt = 1
for i in range(1, num):
    for j in range(0, i):
        if  heights[j] > heights[i]:
             break
    else:
        cnt += 1
print(cnt)

Solution (Python):
n = input()
l = list(input().split())
 
cnt = 0
max_height = 0
for i in range(len(l)):
  if int(l[i]) >= int(max_height):
    cnt +=1
    max_height = l[i]
    
print(cnt)

Solution (Python):
N = int(input())
H = map(int, input().split())

high = 0
score = 0
for value in H:
   if high <= value:
      high = value
      score += 1
      
print(score)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))
cnt = 1
for i in range(n-1) :
  if(h[i] <= h[i+1]) : cnt += 1
  h[i+1] = max(h[i], h[i+1])
print(cnt)

Solution (Python):
n = int(input())
hl = list(map(int,input().split()))

max = 0
cnt = 0
for i in range(n):
  if max <= hl[i]:
    cnt += 1
    max = hl[i]

print(cnt)

Solution (Python):
n = int(input())
h_list = [int(i) for i in input().split()]
count = sum(max(j) == j[-1] for i in range(1, n+1) for j in [h_list[0:i]])
print(count)

Solution (Python):
n = int(input())
h_list = [int(i) for i in input().split()]
whole_list = [h_list[0:i] for i in range(1, n+1)]
count = sum(max(j) == j[-1] for i in range(1, n+1) for j in [h_list[0:i]])
print(count)

Solution (Python):
n = int(input())
h_list = [int(i) for i in input().split()]
whole_list = [h_list[0:i] for i in range(1, n+1)]
count = sum(max(i) == i[-1] for i in whole_list)
print(count)

Solution (Python):
n = int(input())
h_list = [int(i) for i in input().split()]

count = 1
for i in range(1, n):
  flag = True
  for j in range(i):
    if h_list[j] > h_list[i]:
      flag = False
      break
  if flag:
    count +=1

print(count)

Solution (Python):
N = int(input())
tmp_lst = input().split()
H_lst = []
for i in range(N):
    H_lst.append(int(tmp_lst[i]))

count = 1   
for i in range(1,N):
    ocean_vew = True
    for j in range(i):
        if H_lst[j] > H_lst[i]:
            ocean_vew = False
            break
    if ocean_vew:
        count += 1

print(count)

Solution (Python):
N = int(input())
max_num = 1
cnt = 0
list_num = [int(x) for x in input().split()]
for i in range(len(list_num)):
	if max_num <= list_num[i]:
		cnt += 1
		max_num = list_num[i]
print(cnt)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))
cnt = 0
maxH = H[0]

for m in range(1,N):
    if H[m] - maxH >= 0:
        maxH = H[m]
        cnt += 1

print(cnt+1)

Solution (Python):
num_mountain = int(input())
mountains = list(map(int, input().split()))
ans = 1

for my_index in range(num_mountain):
    for opp_index in range(my_index):
        if mountains[opp_index] > mountains[my_index]:
            break
        if my_index - opp_index == 1:
            ans += 1
print(ans)

Solution (Python):
N = int(input())
inpl = list(map(int,input().split()))
for i in range(len(inpl)):
    for i2 in range(i,-1,-1):
        if inpl[i] < inpl[i2]:
            N -= 1
            break
print(N)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

count = 0
max_h = 0

for h in H:
    if h >= max_h:
        count += 1
        max_h = h
        
print(count)

Solution (Python):
n = int(input())
H = [int(i) for i in input().strip().split()]
 
border = 0
can_num = 0
for h in H:
  if h >= border:
    can_num += 1
    border = h
 
print(can_num)

Solution (Python):
a=int(input())
b=input().split()
c=[]
for i in b:
  c+=[int(i)]
cou=1
for i in range(a-1):
  if c[i+1]>=max(c[0:i+1]):
    cou+=1
print(cou)

Solution (Python):


n = int(input())
h = input().split()
h_int = [int(i) for i in h]
count = 0
flag = 0

for i in range(n):
    
    for j in range(i):
        if h_int[i] < h_int[i-1-j]:
            
            flag = 1
            break
    if flag == 0:
        count += 1
    else:
        flag = 0

print(count)

Solution (Python):
n=int(input())
h= list(map(int,input().split()))


count=0
max=h[0]
for i in range(n):
    if max<=h[i]:
        count+=1
        max=h[i]

print(count)

Solution (Python):
n = input()
h_list = map(int, input().split())
a = 0
b = 0
for h in h_list:
  if b <= h:
    b = h
    a += 1
print(a)

Solution (Python):
n = input()
h = list(map(int, input().split()))
first = h[0]
for i in range(1, first):
    num = h.count(i)
    for j in range(num):
        h.remove(i)
deled_num = len(h)
x = 0
for j in range(deled_num - 1):
    if h[x] > h[x+1]:
        h.pop(x+1)
    else:
        x += 1
print(len(h))

Solution (Python):
N = int(input())
mt = list(map(int,input().split()))
cnt = 1
max_h = mt[0]
for i in range(1,N):
  if mt[i]-max_h>=0:
    max_h = mt[i]
    cnt+=1
print(cnt)

Solution (Python):
N = int(input())
H = []*100
H[:] = map(int, input().split())
ct = 1
for i in range(N-1):
    maxim = max(H[:i+1])
    if H[i+1] >= maxim:
        ct += 1
print(ct)

Solution (Python):
N = int(input())
H = input().split()
H = [int(h) for h in H]
ct = 1
for i in range(N-1):
    maxim = max(H[:i+1])
    if H[i+1] >= maxim:
        ct += 1
print(ct)

Solution (Python):
n = int(input())
h = list(map(int, input().split()))
c = 0
for i in range(n):
  l = h[:i+1]
  if max(l) == h[i]:
    c += 1
print(c)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

highest = 0
count = 0

for i in range(N):
  if H[i] >= highest:
    highest = H[i]
    count += 1

print(count)

Solution (Python):
n = int(input())
h = input().split()
num = 1

h = [int(s) for s in h]
for i in range(1, n):
    for j in range(0, i+1):
        if h[j] > h[i]:
            break
        if i == j:
            num += 1

print(num)

Solution (Python):

N = int(input())
lst = list(map(int,input().split()))

max = 0
sum = 0
for i in range(N):
    if max <= lst[i]:
        sum = sum + 1
        max = lst[i]

print(sum)

Solution (Python):
n = int(input())
h_a = [int(i) for i in input().split()]
count = 0

for i, h in enumerate(h_a):
    if h >= max(h_a[0:i+1]):
        count += 1

print(count)

Solution (Python):
input()
t = list(map(int,input().split()))
hmax = 0
ans = 0
for h in t:
    if(hmax <= h):
        ans += 1
        hmax = h
print(ans)

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    
    n = int(input())
    l = list(map(int, input().split()))
    
    view = 0
    
    for i in range(len(l)):
        if max(l[:i + 1]) <= l[i]:
            view = view + 1
            
    print(view)
    
if __name__ == '__main__':
    main()

Solution (Python):
N = input()
mt_lst = list(map(int, input().split()))
cnt = 0

for i in range(len(mt_lst)):
    tmp = mt_lst[0:i+1]
    cnt += 1 if mt_lst[i] == max(tmp) else 0

print(cnt)

Solution (Python):
mt = int(input())
mt_list = list(map(int, input().split()))

j = 0
count = 0

for i in range(mt):

    visible_flg = True

    j = i

    while j > 0:
        if mt_list[i] < mt_list[j-1]:
            visible_flg = False
            break
        j -= 1
    
    if visible_flg:
        count += 1

print(count)

Solution (Python):
from sys import stdin
 
N = int(input())
H = [int(x) for x in stdin.readline().rstrip().split()]
 
c = 1
for i in reversed(range(1,N)):
  if H[i] - H[i-1] >= 0 and H[i] == max(H[:i+1]):
    c += 1
 
print(c)

Solution (Python):
N = int(input()) 
hotel = list(map(int, input().split())) 
view = 1

for i in range (1, N, 1):
    judge = 1
    for j in range (0, i, 1):
        if hotel[i] >= hotel[j]:
            pass
        else:
            judge = 0
            break
    if judge == 1:
        view += 1

print (view)

Solution (Python):
N = int(input())

H = list(map(int, input().split()))

count = 0

for i in range(N):
    cansee = True
    for j in range(i):
        if H[j] > H[i]:
            cansee = False
    
    if cansee:
        count += 1

print(count)

Solution (Python):
n = input()
h_li = list(map(int,input().split()))

result = 1
max_hi = h_li[0]
for i in h_li[1:]:
    if max_hi <= i:
        result = result + 1
        max_hi = i

print(result)

Solution (Python):
n = int(input())
l = map(int, input().split())
hst = 0
cnt = 0
for i in l:
  if hst <= i:
    hst = i
    cnt += 1
print(cnt)

Solution (Python):
input()
H = [int(x) for x in input().split()]

h, N = H[0], 1
for h_i in H[1:]:
    if h_i >= h:
        N += 1
        h = h_i
print(N)

Solution (Python):
N = int(input())
H = [int(x) for x in input().split()]
maxH = 0
ans = 0
for h in H:
    if maxH > h:
        continue
    ans += 1
    maxH = h
print(ans)

Solution (Python):
n=int(input())
lst = list(map(int, input().split()))

ct = 1
for i in range(n-1):
  if max(lst[0:i+1]) <= lst[i+1]:
    ct+=1
    
print(ct)

Solution (Python):



def main():
    n = int(input())
    h = list(map(int, input().split()))
    highest = 0
    ans = 0

    for i in range(n):
        if h[i] >= highest:
            ans += 1
            highest = h[i]

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
h = map(int, input().split())
h = list(h)
max_h = h[0]
cnt = 0

for a in h:
    if a >= max_h:
        cnt += 1
        max_h = a
print(cnt)

Solution (Python):



def main():
    n = int(input())
    h = list(map(int, input().split()))
    highest = 0
    ans = 0

    for i in range(n):
        if h[i] >= highest:
            ans += 1
            highest = h[i]

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
a = input()
H =map(int, input().split())
c=m=0
for h in H:
    if m <= h:
        c+=1
        m=h
print(c)

Solution (Python):
_ = input()
H = map(int, input().split())

c = m = 0
for h in H:
    if m <= h:
        c += 1
        m = h
print(c)

Solution (Python):
N = int(input())

List=list(map(int,input().split()))

sum=1
max=List[0]
for i in List:
    if max<=i:
        max=i
        sum+=1

print(sum-1)

Solution (Python):
N=int(input())
H=list(map(int,input().split()))

m = 0
c = 0
for i in range(N):
	if H[i] >= m:
		c += 1
		m = H[i]
print(c)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))

m = 0
c = 0
for i in range(N):
	if H[i] >= m:
		c += 1
		m=H[i]	
print(c)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

m = 0
c = 0
for i in range(N):
	if H[i] >= m:
		c +=1
		m = H[i]
print(c)

Solution (Python):
def can_view(s):
  t = s[-1]
  for h in s[:-1]:
    if h > t:
      return False
  return True

c = int(input())
hs = list(map(int, input().split(" ")))
a = 0
for i in range(c):
  if can_view(hs[:i+1]):
    a+=1
print(a)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))

m = 0
c = 0
for i in range(N):
    if H[i] >= m:
        c += 1
        m = H[i]
print(c)

Solution (Python):
n=int(input())
l=list(map(int,input().split()))
s=1
for i in range(1,n):
  if l[i]>=max(l[0:i]):
    s=s+1
print(s)

Solution (Python):
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob_1():
    d = Debug()
    d.off()
    S = input()
    d.dmp((S),'S')
    count = 0
    zeroFound = False
    for c in S:
        
        if c == '0':
            zeroFound = True
        elif c == '+':
            if zeroFound:
                zeroFound = False
            else:
                count += 1
        
    if not zeroFound:
        count += 1
    return count

def prob():
    d = Debug()
    d.off()
    N = getInt()
    H = getIntList()
    d.dmp((N,H),'N,H')
    v = zeros(N)
    v[0] = H[0]
    count = 1
    for i in range(N-1):
        if v[i] <= H[i+1]:
            v[i+1] = H[i+1]
            count += 1
        else:
            v[i+1] = v[i]
    d.dmp((v),'v')
    return count


ans = prob()
print(ans)