CF939E Maximize!

Description

You are given a multiset $ S $ consisting of positive integers (initially empty). There are two kind of queries: 1. Add a positive integer to $ S $ , the newly added integer is not less than any number in it. 2. Find a subset $ s $ of the set $ S $ such that the value ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF939E/6f55d1af0b4bb2f506e26b52edc60c22c6c89cc4.png) is maximum possible. Here $ max(s) $ means maximum value of elements in $ s $ , ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF939E/41a32d216cf052c5a047afb797c2b693c1941a38.png) — the average value of numbers in $ s $ . Output this maximum possible value of ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF939E/6f55d1af0b4bb2f506e26b52edc60c22c6c89cc4.png).

Input Format

N/A

Output Format

N/A