#include <bits/stdc++.h>
using namespace std;
const int N = 2501;
int A[N][N], n, head[N * N], cnt;
vector<int> V;
struct edge {
  int x, y, nxt;
} e[N * N];
bitset<N> H[N], L[N];
bool NO() {
  puts("NOT MAGIC");
  exit(0);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) scanf("%d", &A[i][j]), V.push_back(A[i][j]);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (i == j && A[i][i] || A[i][j] != A[j][i]) NO();
  sort(V.begin(), V.end());
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      const int x = lower_bound(V.begin(), V.end(), A[i][j]) - V.begin();
      e[++cnt] = (edge){i, j, head[x]}, head[x] = cnt;
    }
  for (int v = 0; v < n * n; ++v) {
    for (int i = head[v]; i; i = e[i].nxt)
      if ((H[e[i].x] & L[e[i].y]).any()) NO();
    for (int i = head[v]; i; i = e[i].nxt)
      H[e[i].x].set(e[i].y), L[e[i].y].set(e[i].x);
  }
  puts("MAGIC");
  return 0;
}
