7852번 - Nearest number - 2 다국어

Input is the matrix A of N by N non-negative integers.

A distance between two elements A_i,j and A_p,q is defined as |i − p| + |j − q|.

Your program must replace each zero element in the matrix with the nearest non-zero one. If there are two or more nearest non-zeroes, the zero must be left in place. 

Input file contains the number N followed by N² integers, representing the matrix rowby-row. 

Output file must contain N² integers, representing the modified matrix row-by-row. 

• 1 ≤ N ≤ 200, 0 ≤ A_i ≤ 1000000