{"raw_statement":[{"iden":"problem statement","content":"You are given $N$ integers; the $i$\\-th of them is $A_i$. Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\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$\n$:$\n$A_N$"},{"iden":"sample input 1","content":"5\n6\n8\n1\n2\n3"},{"iden":"sample output 1","content":"21\n\nWhen the integers are arranged as $3,8,1,6,2$, the sum of the absolute differences between the adjacent elements is $|3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21$. This is the maximum possible sum."},{"iden":"sample input 2","content":"6\n3\n1\n4\n1\n5\n9"},{"iden":"sample output 2","content":"25"},{"iden":"sample input 3","content":"3\n5\n5\n1"},{"iden":"sample output 3","content":"8"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}