#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2505;
int N, A[MAXN][MAXN], Len;
int Fa[MAXN], B[MAXN * MAXN], Cnt, NCnt;
struct Edge {
  int x, y, z;
} s[MAXN * MAXN];
vector<int> P[MAXN * MAXN];
map<int, int> Mp;
bool cmp(Edge A, Edge B) { return A.z < B.z; }
int Find(int x) { return Fa[x] == x ? x : Fa[x] = Find(Fa[x]); }
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= N; j++) scanf("%d", &A[i][j]);
  for (int i = 1; i <= N; i++) {
    if (A[i][i]) {
      printf("NOT MAGIC\n");
      return 0;
    }
    for (int j = i + 1; j <= N; j++) {
      if (A[i][j] != A[j][i]) {
        printf("NOT MAGIC\n");
        return 0;
      }
      Len++;
      s[Len].x = i;
      s[Len].y = j;
      s[Len].z = A[i][j];
      B[++Cnt] = A[i][j];
    }
  }
  sort(B + 1, B + Cnt + 1);
  sort(s + 1, s + Len + 1, cmp);
  B[0] = -1;
  for (int i = 1; i <= Cnt; i++)
    if (B[i] != B[i - 1]) Mp[B[i]] = ++NCnt;
  for (int i = 1; i <= Len; i++) {
    s[i].z = Mp[s[i].z];
    P[s[i].z].push_back(i);
  }
  for (int i = 1; i <= N; i++) Fa[i] = i;
  for (int i = 1; i <= NCnt; i++) {
    int size = P[i].size();
    for (int j = 0; j < size; j++) {
      int u = P[i][j];
      int x = Find(s[u].x);
      int y = Find(s[u].y);
      if (x == y) {
        printf("NOT MAGIC\n");
        return 0;
      }
    }
    for (int j = 0; j < size; j++) {
      int x = Find(s[P[i][j]].x);
      int y = Find(s[P[i][j]].y);
      if (x != y) Fa[x] = y;
    }
  }
  printf("MAGIC\n");
}
