Largest Number

Arvind loves playing with Numbers. He has a sequence $[A_1, A_2, ..., A_N]$ of $N$ integers. He wants to reduce the length of the sequence to 1. To do that, he performs exactly $N - 1$ moves, where a move is defined as follows. - Pick two Integers $A_i$ and $A_j$, $i \ne j$, remove them from the sequence and append the result obtained by concatenating the Integers to the sequence. He wonders wha