{"raw_statement":[{"iden":"problem statement","content":"Given are $N$ integers $A_1,\\ldots,A_N$.\nFind the sum of $A_i \\times A_j$ over all pairs $(i,j)$ such that $1\\leq i < j \\leq N$, modulo $(10^9+7)$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2\\times 10^5$\n*   $0 \\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$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3\n1 2 3"},{"iden":"sample output 1","content":"11\n\nWe have $1 \\times 2 + 1 \\times 3 + 2 \\times 3 = 11$."},{"iden":"sample input 2","content":"4\n141421356 17320508 22360679 244949"},{"iden":"sample output 2","content":"437235829"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}