The divisor conquers

"Divisor is the Conquerer" is a solitaire card game. The rules follow.

First, draw $N$ cards from a deck. The game uses only the drawn cards, and the rest of the deck stays out of play.

Then put the cards down on the table one at a time. The first card can be any of them. After that you may put down only a card that conquers the cards already on the table. A card conquers a set of cards when the number on the card divides the sum of the numbers in the set. For example, card $7$ conquers the set $\{5, 11, 12\}$, but card $11$ does not conquer the set $\{5, 7, 12\}$.

You win once all $N$ drawn cards are on the table. You lose if at some point no card can be put down.

The input holds several test cases.

Each test case is two lines. The first line has the number of cards $N$ ($1 \le N \le 52$). The second line has the numbers on the cards, $c_1, \dots, c_N$ ($1 \le c_i \le 13$), separated by spaces. Within one test case at most four cards carry the same number.

A $0$ in place of $N$ ends the input.

Print one line for each test case.

If a winning order exists, print the order the cards are put down as $N$ integers separated by single spaces. When several winning orders exist, print only the lexicographically smallest one. For two sequences $A$ and $B$ of the same length, $A$ is lexicographically smaller than $B$ if $A_i < B_i$ at the smallest index $i$ with $A_i \ne B_i$.

If no winning order exists, print No.