This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start\[c\]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, though. Initially the top 25 contestants are invited to come onsite. Each eligible contestant must either accept or decline the invitation. Whenever a contestant declines, the highest ranked contestant not yet invited is invited to take the place of the one that declined. This continues until 25 contestants have accepted invitations.
After the qualifying round completes, you know _K_ of the onsite finalists, as well as their qualifying ranks (which start at 1, there are no ties). Determine the minimum possible number of contestants that declined the invitation to compete onsite in the final round.
## Input
The first line of input contains _K_ (1 ≤ _K_ ≤ 25), the number of onsite finalists you know. The second line of input contains _r_1, _r_2, ..., _r__K_ (1 ≤ _r__i_ ≤ 106), the qualifying ranks of the finalists you know. All these ranks are distinct.
## Output
Print the minimum possible number of contestants that declined the invitation to compete onsite.
[samples]
## Note
In the first example, you know all 25 onsite finalists. The contestants who ranked 1\-st, 13\-th, and 27\-th must have declined, so the answer is 3.
今年，和往年一样，MemSQL 将邀请 Start[c]up 资格赛前 25 名选手到场参加决赛轮比赛。然而，并非所有有资格到场的选手都能负担得起前往办公室的旅行费用。最初，前 25 名选手会被邀请到场。每位有资格的选手必须接受或拒绝邀请。每当一位选手拒绝邀请时，排名最高的尚未被邀请的选手将被邀请顶替其位置。这个过程持续进行，直到有 25 名选手接受邀请为止。
资格赛结束后，你已知 #cf_span[K] 名到场决赛选手及其资格排名（排名从 #cf_span[1] 开始，无并列）。请确定最少可能有多少名选手拒绝了到场参加决赛轮的邀请。
输入的第一行包含 #cf_span[K]（#cf_span[1 ≤ K ≤ 25]），表示你已知的到场决赛选手人数。第二行包含 #cf_span[r1, r2, ..., rK]（#cf_span[1 ≤ ri ≤ 106]），表示你已知的这些决赛选手的资格排名。所有这些排名互不相同。
请输出最少可能有多少名选手拒绝了到场邀请。
在第一个例子中，你已知全部 25 名到场决赛选手。排名为 #cf_span[1]-st、#cf_span[13]-th 和 #cf_span[27]-th 的选手必定拒绝了邀请，因此答案为 #cf_span[3]。
## Input
输入的第一行包含 #cf_span[K]（#cf_span[1 ≤ K ≤ 25]），表示你已知的到场决赛选手人数。第二行包含 #cf_span[r1, r2, ..., rK]（#cf_span[1 ≤ ri ≤ 106]），表示你已知的这些决赛选手的资格排名。所有这些排名互不相同。
## Output
请输出最少可能有多少名选手拒绝了到场参加决赛轮的邀请。
[samples]
## Note
在第一个例子中，你已知全部 25 名到场决赛选手。排名为 #cf_span[1]-st、#cf_span[13]-th 和 #cf_span[27]-th 的选手必定拒绝了邀请，因此答案为 #cf_span[3]。
**Definitions**
Let $ K \in \mathbb{Z} $ be the number of known onsite finalists, with $ 1 \leq K \leq 25 $.
Let $ R = \{r_1, r_2, \dots, r_K\} $ be the set of distinct qualifying ranks of known finalists, where $ 1 \leq r_i \leq 10^6 $.
Let $ S $ be the set of 25 contestants who ultimately accepted invitations, with $ R \subseteq S $.
Let $ D $ be the number of contestants who declined their initial invitation.
**Constraints**
1. The initial invitation list is the top 25 ranked contestants: $ \{1, 2, \dots, 25\} $.
2. Declines are replaced by the next highest-ranked eligible contestant not yet invited, in ascending rank order.
3. The final set $ S $ contains exactly 25 accepted contestants.
4. All known finalists have ranks in $ R $, and $ |S| = 25 $.
**Objective**
Minimize $ D = $ number of declines, which equals the number of initial top-25 contestants who did not end up in $ S $.
Equivalently:
$$
D = 25 - |\{1, 2, \dots, 25\} \cap S|
$$
To minimize $ D $, maximize $ |\{1, 2, \dots, 25\} \cap S| $, given that $ R \subseteq S $.
Thus, the minimum number of declines is:
$$
\boxed{25 - \left| \{1, 2, \dots, 25\} \cap S \right|}
$$
Since $ S $ must include $ R $, the maximum number of known finalists that can be from the initial top 25 is $ |\{1, 2, \dots, 25\} \cap R| $. The remaining $ 25 - |\{1, 2, \dots, 25\} \cap R| $ spots in $ S $ must be filled by contestants ranked $ >25 $, each requiring one decline.
Hence, the minimum number of declines is:
$$
\boxed{25 - \left| \{ r \in R \mid r \leq 25 \} \right|}
$$