{"raw_statement":[{"iden":"problem statement","content":"We have a sequence of $N$ positive integers: $A_1,A_2,\\cdots,A_N$. You are to rearrange these integers into another sequence $x_1,x_2,\\cdots,x_N$, where $x$ must satisfy the following condition:\n\n*   Let us define $y_i=\\operatorname{LCM}(x_1,x_2,\\cdots,x_i)$, where the function $\\operatorname{LCM}$ returns the least common multiple of the given integers. Then, $y$ is strictly increasing. In other words, $y_1<y_2<\\cdots<y_N$ holds.\n\nDetermine whether it is possible to form a sequence $x$ satisfying the condition, and show one such sequence if it is possible."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 100$\n*   $2 \\leq A_1 < A_2 \\cdots < A_N \\leq 10^{18}$\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$ $\\cdots$ $A_N$"},{"iden":"sample input 1","content":"3\n3 4 6"},{"iden":"sample output 1","content":"Yes\n3 6 4\n\nFor $x=(3,6,4)$, we have:\n\n*   $y_1=\\operatorname{LCM}(3)=3$\n*   $y_2=\\operatorname{LCM}(3,6)=6$\n*   $y_3=\\operatorname{LCM}(3,6,4)=12$\n\nHere, $y_1<y_2<y_3$ holds."},{"iden":"sample input 2","content":"3\n2 3 6"},{"iden":"sample output 2","content":"No\n\nNo permutation of $A$ would satisfy the condition."},{"iden":"sample input 3","content":"10\n922513 346046618969 3247317977078471 4638516664311857 18332844097865861 81706734998806133 116282391418772039 134115264093375553 156087536381939527 255595307440611247"},{"iden":"sample output 3","content":"Yes\n922513 346046618969 116282391418772039 81706734998806133 255595307440611247 156087536381939527 134115264093375553 18332844097865861 3247317977078471 4638516664311857"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}