F. Magic Matrix
brute force; divide and conquer; graphs; matrices; trees
You're given a matrix A of size n × n.Let's call the matrix with nonnegative elements magic if it is symmetric (so aij = aji), aii = 0 and aij ≤ max(aik, ajk) for all triples i, j, k. Note that i, j, k do not need to be distinct.Determine if the matrix is magic.As the input/output can reach very huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.
The first line contains integer n (1 ≤ n ≤ 2500) — the size of the matrix A.Each of the next n lines contains n integers aij (0 ≤ aij < 109) — the elements of the matrix A.Note that the given matrix not necessarily is symmetric and can be arbitrary.
Print ''MAGIC"" (without quotes) if the given matrix A is magic. Otherwise print ''NOT MAGIC"".