def accum_dp(xs: list, f, op, e, init: dict):
    dp = init.copy()
    for x in xs:
        pp = {}
        dp, pp = pp, dp
        for fm_key, fm_val in pp.items():
            for to_key, to_val in f(fm_key, fm_val, x):
                dp[to_key] = op(dp.get(to_key, e), to_val)

    return dp


def f(k, v, x):
    # k : 餅の大きさ

    match k:
        case -1:  # 普通の餅
            yield -1, v
            yield x, v+1  # ずんだ餅

        case _:
            yield -1, v
            if k == x:
                yield k, v+1
            else:
                yield max(k, x), v


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

init = {-1: 0}
dp = accum_dp(A, f, max, 0, init)
ans = max(dp.values())
print(ans)