{"raw_statement":[{"iden":"problem statement","content":"Let ${\\rm comb}(n,r)$ be the number of ways to choose $r$ objects from among $n$ objects, disregarding order. From $n$ non-negative integers $a_1, a_2, ..., a_n$, select two numbers $a_i > a_j$ so that ${\\rm comb}(a_i,a_j)$ is maximized. If there are multiple pairs that maximize the value, any of them is accepted."},{"iden":"constraints","content":"*   $2 \\leq n \\leq 10^5$\n*   $0 \\leq a_i \\leq 10^9$\n*   $a_1,a_2,...,a_n$ are pairwise distinct.\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$n$\n$a_1$ $a_2$ $...$ $a_n$"},{"iden":"sample input 1","content":"5\n6 9 4 2 11"},{"iden":"sample output 1","content":"11 6\n\n$\\rm{comb}(a_i,a_j)$ for each possible selection is as follows:\n\n*   $\\rm{comb}(4,2)=6$\n*   $\\rm{comb}(6,2)=15$\n*   $\\rm{comb}(6,4)=15$\n*   $\\rm{comb}(9,2)=36$\n*   $\\rm{comb}(9,4)=126$\n*   $\\rm{comb}(9,6)=84$\n*   $\\rm{comb}(11,2)=55$\n*   $\\rm{comb}(11,4)=330$\n*   $\\rm{comb}(11,6)=462$\n*   $\\rm{comb}(11,9)=55$\n\nThus, we should print $11$ and $6$."},{"iden":"sample input 2","content":"2\n100 0"},{"iden":"sample output 2","content":"100 0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}