{"raw_statement":[{"iden":"problem statement","content":"Given is an $N \\times N$ matrix $C$ whose elements are non-negative integers. Determine whether there is a pair of sequences of non-negative integers $A_1,A_2,\\ldots,A_N$ and $B_1,B_2,\\ldots,B_N$ such that $C_{i,j}=A_i+B_j$ for every $(i, j)$. If the answer is yes, print one such pair."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 500$\n*   $0 \\leq C_{i,j} \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$C_{1,1}$ $C_{1,2}$ $\\ldots$ $C_{1,N}$\n$C_{2,1}$ $C_{2,2}$ $\\ldots$ $C_{2,N}$\n$:$\n$C_{N,1}$ $C_{N,2}$ $\\ldots$ $C_{N,N}$"},{"iden":"sample input 1","content":"3\n4 3 5\n2 1 3\n3 2 4"},{"iden":"sample output 1","content":"Yes\n2 0 1\n2 1 3\n\nNote that $A$ and $B$ consist of non-negative integers."},{"iden":"sample input 2","content":"3\n4 3 5\n2 2 3\n3 2 4"},{"iden":"sample output 2","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}