{"raw_statement":[{"iden":"problem statement","content":"You are given a sequence of positive integers: $A=(a_1,\\ldots,a_N)$.\nDetermine whether it is possible to make all elements of $A$ equal by repeating the following operation between $0$ and $10^4$ times, inclusive. If it is possible, show one way to do so.\n\n*   Choose a permutation $(p_1,\\ldots,p_N)$ of $(1,\\ldots,N)$, and replace $A$ with $(a_1+p_1,\\ldots,a_N+p_N)$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 50$\n*   $1 \\leq a_i \\leq 50$\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$a_1$ $\\ldots$ $a_N$"},{"iden":"sample input 1","content":"2\n15 9"},{"iden":"sample output 1","content":"Yes\n8\n1 2\n1 2\n1 2\n1 2\n2 1\n1 2\n1 2\n1 2\n\nThis sequence of $8$ operations makes $A = (24,24)$, where all elements are equal."},{"iden":"sample input 2","content":"5\n1 2 3 10 10"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"4\n1 1 1 1"},{"iden":"sample output 3","content":"Yes\n0\n\nAll elements of $A$ are equal from the beginning."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}