J. youngmagician's victory is made of numerous duplicates of himself and stop ak

    传统题 1000ms 256MiB

youngmagician's victory is made of numerous duplicates of himself and stop ak

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Problem Description

Single elimination tournament, also known as knockout tournament, is a competition format where participants compete in a series of matches, and the loser of each match is eliminated from the tournament. The tournament continues until only one participant remains, who is then declared the winner. This format is commonly used in various sports and competitive events to determine a single champion.

Youngmagician is now participating in an elimination tournament, but his power are very weak. He decides to compensate for his lack of quality by using quantity. He plans to enter the competition with numerous duplicates of himself simultaneously.

The total number of participants in the competition is 2^n, among which those with a power of 1 are duplicates of Youngmagician. Please help calculate Youngmagician's highest achievement and cheers to his achievement, "we are top xx !"

Input Format

an integer number n.

the next line contains (2^n) interger number.

Output Format

a string .

Sample

样例输入

3
2 1 1 1 1 1 1 2

样例输出

we are top 4 !

样例解释

Youngmagician's two duplicates entered the quarter-finals, but they were successively eliminated by two other participants with a power of 2. Therefore, Youngmagician is top 4(四强).

Hint

1≤n≤201\leq n \leq 20。 power pp ,1≤p≤1e181\leq p \leq 1e18。

重庆邮电大学第十七届ACM程序设计大赛(现场赛)

未参加
状态
已结束
规则
XCPC
题目
11
开始于
2024-3-16 13:05
结束于
2024-3-16 18:05
持续时间
5 小时
主持人
参赛人数
2