{"raw_statement":[{"iden":"problem statement","content":"Given are $N$ integers $A_1,\\ldots,A_N$.\nFind the sum of $|A_i-A_j|$ over all pairs $i,j$ such that $1\\leq i < j \\leq N$.\nIn other words, find $\\displaystyle{\\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} |A_i-A_j|}$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $|A_i|\\leq 10^8$\n*   $A_i$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3\n5 1 2"},{"iden":"sample output 1","content":"8\n\nWe have $|5-1|+|5-2|+|1-2|=8$."},{"iden":"sample input 2","content":"5\n31 41 59 26 53"},{"iden":"sample output 2","content":"176"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}