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):
n = int(input())
h = list(map(int, input().split()))
c = 1
for i in range(1, n):
    b = [x for x in h[:i] if x > h[i]]
    if len(b) == 0:
        c = c + 1
print(c)

Solution (Python):
N = int(input())
n = list(map(int, input().split()))
c = 1
for i in range(1, N):
  for j in range(i):
    if n[j] > n[i]:
      break
    if j == i - 1:
      c += 1
print(c)

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

c = 1
er = h[0]
for i in range(n - 1):
    if er <= h[i+1]:
        er = h[i+1]
        c += 1
print(c)

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

saidai = 0
count = 0
for i in range(n):
    if saidai <= h[i]:
        count = count+1
        saidai = h[i]
    else:
        continue
print(count)

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

for i in range(1, N):
    for j in range(0, i):
        if H[i] < H[j]:
            ans -= 1
            break

print(ans)

Solution (Python):
n = int(input())
m = list(map(int, input().split()))
b = m[0]
b2 = m[0]
t = 0
for i in range(len(m)):
    if(m[i]>=b2):
        t += 1
        b2 = m[i]
print(t)

Solution (Python):
from sys import stdin
import math
import itertools


def makeIntMatrix(lines):
    intMatrix = []
    for a in makeStringMatrix(lines):
        intMatrix.append([int(b) for b in a])
    return intMatrix
 
 
def makeStringMatrix(lines):
    stringMatrix = [line.split() for line in lines]
    return stringMatrix
 
 
def makeInt(line):
    return int(line.rstrip())
 
 
def makeMultiInteger(line):
    return [int(x) for x in line.rstrip().split()]


def solve(input_string):
    N = makeInt(input_string[0])
    t = makeMultiInteger(input_string[1])
    c = 0
    for i in range(N):
        if i == 0:
            c += 1
            continue
        elif t[i] >= max(t[:i]):
            c += 1
    return c


def main():
    input_lines = stdin.readlines()
    answer = solve(input_lines)
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):
x = input()
m = [int(i) for i in input().split()]
compare = m[0]
count = 1
for i in range(1, int(x)):
  if m[i] >= compare:
    count += 1
    compare = m[i]
print(count)

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

m = -1

res = 0
for d in data:
    if d>=m:
        res+=1
    m = max(m,d)
print(res)

Solution (Python):
def main() -> None:
    N = int(input())
    H = [int(i) for i in input().split()]
    m = H[0]
    t = []
    ans = 0
    for i in range(0, len(H)):
        t.append(H[i])
        if max(t) <= H[i]:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
N=int(input())
H=list(map(int,input().split()))
i=0
counter=0
saidai=0
while i<N:
    if saidai<=H[i]:
        saidai=H[i]
        counter=counter+1
    i=i+1
print(counter)

Solution (Python):
N = int(input())
H = list(map(int, input().split(" ")))
cnt=0
for i in range(N):
    if i==0:
        cnt+=1
    else:
        h=H[i]
        c=0
        for j in range(i):
            if H[j]>h:
                c=1
        if c==0:
            cnt+=1
print(cnt)

Solution (Python):
mount_count = input()
mount_heights = input()
mount_heights_list = mount_heights.split()
count = 0
max_height = int(mount_heights_list[0])
for mount_height in mount_heights_list:
    if max_height <= int(mount_height):
        max_height = int(mount_height)
        count += 1
print(count)

Solution (Python):
n = int(input())
inns = list(map(int, input().split()))
res = []

for k, v in enumerate(inns):
  res.append(all(list(map(lambda x: x <= v, inns[:k + 1]))))

print(res.count(True))

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

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

Solution (Python):
import numpy as np



N = int(input())
H = list(map(int,input().split()))
tmp = 0
for i in range(N):
    if H[i] == max(H[0:i+1]):
        tmp += 1

print(tmp)

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

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

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

for i in range(n):
  b = False
  for j in range(i):
    if hs[j] > hs[i]:
      b = True
  if not b:
    ss.append(i)
print(len(ss))

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

max = 0
c = 0

for h in hs:
    if h >= max:
        c += 1
        max = h

print(c)

Solution (Python):
import numpy as np
N = int(input())
h = np.array(list(map(int, input().split())))


count = 0
for i in range(1,N+1):
  mounts = h[:i]
  mounts_ = np.where(mounts<=h[i-1],0,1)
  if np.sum(mounts_) == 0:
    count += 1
print(count)

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

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

    hh = l[0]
    cnt = 0
    
    for i in l:
        if i >= hh:
            cnt += 1
            hh = i
    
    print(cnt)

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
mountains = list(map(int, input().split()))
memo = 0
result = []
for m in mountains:
    if (m >= memo):
        memo = m
        result.append(m)
print(len(result))

Solution (Python):
N = int(input())
H = input().split()
max_height = 0
count = 0

for j in range(N):
    if int(H[j]) >= max_height :
        count = count + 1
        max_height = int(H[j])

print(count)

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

Solution (Python):
N=int(input())
H=list(map(int, input().split()))
Hi=0;a=0
for i in range(N):
  if int(H[i])>Hi:
    Hi=int(H[i])
    a+=1
  elif int(H[i])==Hi:
    a+=1
print(a)

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

count = 1
for i in range(1, len(H)):
    pred = [c <= H[i] for c in H[:i]]
    if all(pred):
        count += 1
        
print(count)

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

count = 0
max_h = 0
for h in H:
  if max_h <= h:
    count += 1
    max_h = h

print(count)

Solution (Python):
import sys
N = sys.stdin.readline()
N = int(N)



H = sys.stdin.readline().split()


max_H = 0
cnt = 0
for i in range(len(H)):
    if(max_H<=int(H[i])):

        max_H = int(H[i])
        cnt += 1


    
print(cnt)

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

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


acc = 0
maximum = h_list[0]
for n in h_list:
    tmp = n
    if maximum <= n:
        acc += 1
        maximum = n

print(acc)

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

res = 0
cum_max = 0
for i in range(N):
    cum_max = max(cum_max, H_list[i])
    if cum_max <= H_list[i]:
        res += 1
print(res)

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

print(ans)

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

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

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

Solution (Python):

def get_input():
    N = int(input())
    H = [int(_) for _ in input().split(" ")]
    return N,H

def solve(N,H):
    maximums = [max(H[:i+1]) for i in range(N)]
    count = 0
    for h,maximum in zip(H,maximums):
        if h>=maximum:
            count+=1
    return count 

if __name__ == "__main__":
    N,H = get_input()
    ans = solve(N,H)
    print(ans)

Solution (Python):
from sys import stdin
N = int(stdin.readline().rstrip())
s_data = stdin.readline().rstrip().split()
height = [int(itr) for itr in s_data]
ans = 1
for h in range(0,N):
    if h == 0:
        continue
    if height[h] >= max(height[:h]):
        ans += 1
print(ans)

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

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

ans = 1
for i,v in enumerate(l):
    for k in range(0,i):
        if l[k] > l[i]:
            break
        if k == i - 1:
            ans = ans + 1

print(ans)

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

Solution (Python):
n = int(input())
h = [int(x) for x in input().split()]
limit = h.pop(0)
result = 1
for height in h:
    if height >= limit:
        result += 1
        limit = height
print(result)

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

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

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

tmp_max = 0
update_cnt = 0
for i in range(0, N):
    if tmp_max <= H[i]:
        tmp_max = H[i]
        update_cnt += 1

print(update_cnt)

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

cnt = 1
for i in range(1,N):
    if max(H[:i]) <= 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 range(n):
    if h[i] >= max_h:
        cnt += 1
        max_h = h[i]
print(cnt)

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

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

height = 0
res = 0
for h in H:
    if h >= height:
        res += 1
    height = max(height, h)

print(res)

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

higest = 0
count = 0
for h in H_list:
    if h >= higest:
        higest = h
        count += 1
print(count)

Solution (Python):
N=int(input())
mt=list(map(int,input().split(" ")))
count=0
for i in range(N):
    if i==0:
        count +=1
    else:
        if max(mt[:i]) <=mt[i]:
            count +=1

print(count)

Solution (Python):



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

current=0
cnt=0
for i in h:
    if i >= current:
        current = i
        cnt += 1

print(cnt)

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

max_h = 0
cnt = 0
for n in range(0, N):
    if Hs[n] >= max_h:
        max_h = Hs[n]
        cnt += 1
print(cnt)

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

for i in range(N):
  data.append(H[i])
  ma=max(data)
  if H[i]>=ma:
    count=count+1
    
print(count)

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

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 = input()
input_char = input()
input_char = input_char.split(" ")

mountains_heigh = [int(h) for h in input_char]

viewable_count = 1
for idx,h in enumerate(mountains_heigh):
    if idx >0 :
        max_h_behind = max(mountains_heigh[:idx])
        if max_h_behind <= h :
            viewable_count+= 1

print(viewable_count)

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

count = 1
for h1 in range(1, N):
    result = True
    for h2 in range(h1):
        if h_list[h2] > h_list[h1]:
            result = False
    if result:
        count += 1
print(count)

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
i = 0
j = 0
k = 0
m = 0

for i in range(n):
    for j in range(i):
        if l[j] >= k:
           k = l[j]
    if l[i] >= k:
        m = m + 1

    
print(m)

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

h = list(map(int, input().split()))
s = 1

max = h[0]

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

print(s)

Solution (Python):
n = int(input())
h_list = list(map(int,input().split()))	
count = 0
view = True
for index,h in enumerate(h_list):
    target_h = h
    for i in range(index):
        if target_h >= h_list[i]:
            pass
        else:
            view = False
            break
    if view:
        count += 1
    view = True

print(count)

Solution (Python):

n = int( input() )

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

ans = 0
max_ = H[0]
for hi in H:
    if max_ <= hi:
        ans += 1
        max_ = hi

print(ans)

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

res = H[0]
num = 0
for i in range(N):
  if res <= H[i]:
    num += 1
    res = H[i]
  else:
    pass
print(num)

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

ans = 0

for i in range(1, N + 1) :
    judge = True
    for j in range(i) :
        if H[i] < H[j] :
            judge = False
            break
    if judge :
        ans += 1

print(ans)

Solution (Python):
N = int(input())
H_list = list(map(int, input().split()))
result = 1
level = H_list.pop(0)
for H in H_list:
    if level <= H:
        result += 1
        level = H
print(result)

Solution (Python):
n = int(input())
h_list = list(map(int, input().split()))
h_list = h_list[:n]
count = 0
last_h = 0
for index,h in enumerate(h_list):
	if last_h <= h:
		count += 1
	
	if last_h <= h:
		last_h = h

print(count)

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

for i in range(1, n):
    no_flag = 0
    for j in range(i):
        if h[j] > h[i]:
            no_flag = 1
        else:
            pass
    if no_flag == 0:
        total += 1

print(total)

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

ans=0
for i in range(len(h)):
    if i == 0:
        ans+=1
    else:
        high=max(h[:i])
        if h[i]>=high:
            ans+=1

print(ans)

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

print(counter)

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

Solution (Python):
N = int(input())
H = list(int(i) for i in (input().split()))
H_max = []
tmp = 0
cnt = 0
for i in range (N):
  if (tmp < H[i]):
    H_max.append(H[i])
    tmp = H[i]
  else:
    H_max.append(tmp)
  if(H[i] >= H_max[i]):
    cnt += 1
print(cnt)

Solution (Python):

N = int(input())
H = input().split()
ans = 1

for i in range(1,N):
  tmp = 0
  for j in range(i):
    if int(H[i]) < int(H[j]):
      tmp = 1
      break
  if tmp == 0:
    ans += 1
    
print(ans)

Solution (Python):
N = int(input())
hLst = list(map(int, input().split()))
hMax = hLst[0]
ans = 1
for i in range(1, len(hLst)):
    if hLst[i] >= hMax:
        ans += 1
        hMax = hLst[i]

print(ans)

Solution (Python):

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

ans = 1
for i, val in enumerate(H):
    if i == 0:
        continue

    if not sum(x > val for x in H[:i]):
        ans += 1

print(ans)

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

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

for i, x in enumerate(h):
    for j in range(i):
        if h[j] > x:
            break
    else:
        ans += 1

print(ans)

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

Solution (Python):
import sys
input = sys.stdin.readline

n = int(input())

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

lis = [h_lis[0]]

ans = []

for x in h_lis:
    if (x >= max(lis)):
        ans.append(x)
    lis.append(x)

print(len(ans))

Solution (Python):
N = int(input())
mnt = [int(i) for i in input().split()]
cnt = 0
for i,x in enumerate(mnt):
    if max(mnt[0:i+1]) == x:
        cnt += 1
print(cnt)

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

Solution (Python):
input()
H = [int(i) for i in input().split()]
res = 0
tmp = 0
for h in H:
    if h>=tmp:
        res+=1
        tmp = h
print(res)

Solution (Python):
"""
python3 a.py < input.txt
"""
import math
import itertools as it
import heapq

N=int(input())
H=list(map(int,input().split()))
n=0
print(len([hi for i,hi in enumerate(H) if i == 0 or (i > 0 and max(H[:i]) <= hi)]))

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

Solution (Python):
input()
lis = list(map(int, input().split()))
print(len([n for i, n in enumerate(lis[1:]) if n >= max(lis[:i + 1])]) + 1)

Solution (Python):
N = int(input())
a = list(map(int, input().split()))
res = 1

for i in range(1,N):
    if a[i] >= max(a[0:(i)]):
        res +=1
    
print(res)

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

Solution (Python):
from sys import stdin

def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()



N = ri()
H = ria()

cnt = 0
ma = 0
for i in range(N):
    if (H[i] >= ma ): cnt += 1
    ma = max(ma, H[i])

print(cnt)

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

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

count = 0
max = 0
for h in H:
    if max <= h:
        max = h
        count += 1

print(count)

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

total =0
for n,i in enumerate(l):
    if n == 0:
        total+=1
    else:
        flag = True
        for ii in l[:n]:
            if ii>i:
                flag = False
                break
        if flag:
            total+=1
print(total)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))
count = 0
highest = 0
for h in H:
    if h >= highest:
        highest = h
        count +=1

print(count)

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

max_height = 0
count = 0
for H in Hs:
  if max_height <= H:
    count += 1
    max_height = H
print(count)

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

ans = 1
for i in range(1, n):
  if all(h[i] >= h[j] for j in range(i)):
    ans += 1
  else:
    continue
print(ans)

Solution (Python):
x = int(input()) 
h = list(map(int,input().split()))
count = 0
height = 0
for i in range(len(h)):
    if h[i] >= height:
        count += 1
        height = h[i]

print (count)

Solution (Python):
import sys

input = sys.stdin.readline
n = int(input())
h_list = list(map(int, input().split()))
max_h = 0
cnt = 0
for h in h_list:
    if h >= max_h:
        cnt += 1
        max_h = h
print(cnt)

Solution (Python):
n = int(input())
h_list = list(map(int,input().split()))
l = []
for i in range(n):
    if i == 0:
        l.append(h_list[i])
    else:
        if h_list[i] >= h_list[i-1] and h_list[i] >= max(l):
            l.append(h_list[i])
print(len(l))

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

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


print(count)

Solution (Python):
import sys

def ii2ss(n):
    return [sys.stdin.readline() for _ in range(n)]

def sp2nn(sp, sep=' '):
    return [int(s) for s in sp.split(sep)]

def ss2nn(ss):
    return [int(s) for s in list(ss)]

def main(ss):
    H = sp2nn(ss[1])
    hmax = -1
    count = 0
    for h in H:
        if h >= hmax:
            count += 1
            hmax = h
    print(count)

main(ii2ss(2))

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

Solution (Python):
import numpy as np

N = int(input())
H = np.empty(N)
H = np.array(list(map(int, input().split())))

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

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

_count=1
max_height=H[0]

for i in range(1,N):
    if max_height <= H[i]:
        _count +=1
        max_height = H[i]
print(_count)

Solution (Python):

N = int(input())
h = map(int,input().split())
H = []
for c in h:
    H.append(int(c))

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

print(count)

Solution (Python):
def umi(n,a):
    ii=1 
    for i in range(1,n):
        if a[i]>=max(a[:i]):
            ii += 1
    return ii
n=int(input())
a=list(map(int,input().split()))
print(umi(n,a))

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

for i in range(N-1):
    if H[i+1] >= max_height:
        ans += 1
        max_height = H[i+1]

print(ans)

Solution (Python):
from sys import stdin

import numpy as np




N = int(stdin.readline().rstrip().split()[0])
H = [int(x) for x in stdin.readline().rstrip().split()]
H = np.array(H)

ans = 0
for i in range(N):
  max_m = H[:i+1].max()
  if max_m==H[i]:
    ans += 1

print(ans)

Solution (Python):
n = int(input())
hs = map(int, input().split())
ans = 0
buf = 0
for h in hs:
    if h >= buf:
        ans += 1
        buf = h
print(ans)

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

result = list(filter(lambda h: h, [Hs[i] == max(Hs[:i + 1]) for i in range(len(Hs))]))
print(len(result))

Solution (Python):
n = input()
x=0
mh = 0
for i in input().split():
    i = int(i)
    if i >= mh:
        x += 1
        mh = i

print(x)

Solution (Python):
N = int(input())
H = list(map(int,input().split()))
maxH = 0
n = 1

for i, h in enumerate(H):
  if i == 0:
  	maxH = h
  else:
    if h >= maxH:
    	n += 1
    	maxH = h
    
print(n)

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

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



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

print(ans)

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

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

count = 1

for i in range(1, N):
    nn = 0
    A = H[:i+1]
    for j in A[:-1]:
        if j > A[-1]:
            nn += 1
    if nn==0:
        count += 1

print(count)

Solution (Python):
n=input()
a=list(map(int,input().split(" ")))
count=0
currMax=a[0]-1
for it in a:
    if(it >= currMax):
        count+=1
        currMax=it
print(count)

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

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

hotels = [int(c) for c in input().split()]

count = 1
highest = hotels[0]
for i in range(1, len(hotels)):
    if highest <= hotels[i]:
        count += 1
        if highest < hotels[i]:
            highest = hotels[i]

print(count)

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

Solution (Python):
n = int(input())
l = [int(i) for i in input().split()]
H = l[0]
cnt=1
for p in range(1,n,1):
    if H <= l[p]:
        cnt+=1
        H = l[p]
print(cnt)

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

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

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

Solution (Python):
N = int(input())
yama = [0]
visble = 0
takasa = list(map(int,input().split()))
for n in range(N):
    if max(yama) <= takasa[n]:
        visble += 1
    yama.append(takasa[n])
print(visble)

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

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

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

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


ans = 0 
tmp_max = -1
for i in range(N) :
    if(height_list[i] >= tmp_max) :
        tmp_max = height_list[i]
        ans += 1
        

print(ans)

Solution (Python):
import sys

def main(inp):
    N=int(next(inp))
    H=list(map(int,next(inp).split()))
    
    ans=0
    high=0
    for i in range(N):
        if(high<=H[i]): ans+=1
        high=max(high,H[i])
    
    return ans
    
print(main(sys.stdin))

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

h = 0
num = 0
for i in H:
    if h <= i:
        num += 1
        h = i
print(num)

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

h_max_till_i = 0
ans = 0
for i in range(N):
    if H[i] >= h_max_till_i:
        ans += 1
        h_max_till_i = H[i]

print(ans)

Solution (Python):

def main():
	N = int(input())
	H = list(map(int,input().split()))
	
	count = 1
	for i,ryokan in enumerate(H[1:]) :
		flag = False
		for o in H[:i+1] :
			if o <= ryokan :
				flag = True
			else :
				flag = False
				break
		if flag == True :
			count += 1
	print(count)

if __name__ == "__main__" :
	main()

Solution (Python):

n = int(input())

l = [int(x) for x in input().split()]

maxx = 0
cnt = 0

for i in range(n):
	if maxx <= l[i]:
		maxx = l[i]
		cnt += 1

print(cnt)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))
ans = 0
max_height = 0
for hotel in H:
    if hotel >= max_height:
        ans += 1
        max_height = hotel
    else:
        pass

print(ans)

Solution (Python):
read = input
n = int(read())
A = list(map(int, read().split()))
cnt = 0
for p in enumerate(A):
    i, x = p
    if i == 0:
        cnt = cnt + 1
    elif x >= max(A[0:i]):
        cnt = cnt + 1
print(cnt)

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

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

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

print(cnt)

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

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

mh = h[0]
cv = 1

for i in range(1, n):
  if h[i] >= mh:
    mh = h[i]
    cv += 1
    
print(cv)

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

count = 0
for i in range(N):
    flg = True
    for j in range(i):
        if H[i] < H[j]:
            flg = False
            break
    if flg:
        count += 1
print(count)

Solution (Python):
N = int(input())
H = list(map(int, input().split()))
count = 0
maxh = 0
for x in H:
    if x >= maxh:
        count += 1
        maxh = x
print(count)

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
import collections
from operator import itemgetter

def j(q):
    if q==1: print("Yay!")
    else:print(":(")
    exit(0)


def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])
def combinations(n,r):
    if n<r:return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def permutations(n,r):
    if n<r:return 0
    return math.factorial(n) // math.factorial(n - r)
n = ip()                                     

a = [int(i) for i in input().split()]        







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

Solution (Python):
n = int(input())
h = list(map(int,(input().strip().split(' '))))
m = h[0]
t = 1
for i in range(1, len(h)):
    if m <= h[i]:
        m = h[i]
        t += 1
print(t)

Solution (Python):
import sys
import itertools

input = sys.stdin.readline

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

highest = 0
ans = 0
for h in H:
  if h >= highest:
    ans += 1
    highest = h

print(ans)

Solution (Python):
n=int(raw_input())
a=map(int, raw_input().split())
ans=0
for i in range(n):
  if i == sum([a[j]<=a[i] for j in range(i)]): ans+=1
print ans