{"raw_statement":[{"iden":"problem statement","content":"Among the ways to label the edges of a complete graph $G$ with $N$ vertices with positive integers, a graph satisfying the following condition is called a \"good complete graph\".\n\n*   There exists no path that visits all $N$ vertices exactly once and whose sequence of edge labels, in the order the edges are traversed, is non-decreasing.\n\nDetermine whether a good complete graph exists. If it exists, construct one that minimizes the maximum label assigned to an edge."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 20$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"5"},{"iden":"sample output 1","content":"Yes\n2 1 4 4\n4 3 1\n1 3\n2\n\nFor example, consider the path that visits vertices in the order $2, 5, 1, 4, 3$. The sequence of edge labels traversed is $(1, 4, 4, 1)$, which is not non-decreasing.\nMoreover, there is no path whose sequence of edge labels is non-decreasing, so this graph satisfies the condition.\nAlso, when $N=5$, it is impossible to assign labels so that the maximum label assigned to an edge is $3$ or less, so this output is valid."},{"iden":"sample input 2","content":"2"},{"iden":"sample output 2","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}