#include <bits/stdc++.h>
using namespace std;
int n, a[2505][2505], fa[2505], dep[2505], p[2505], bo[2505];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      scanf("%d", &a[i][j]);
      if (i == j && a[i][j] != 0) {
        puts("NOT MAGIC");
        return 0;
      }
      if (i > j && a[i][j] != a[j][i]) {
        puts("NOT MAGIC");
        return 0;
      }
    }
  bo[1] = 1;
  for (int i = 2; i <= n; i++) fa[i] = 1, p[i] = a[1][i], dep[i] = 1;
  for (int i = 2; i <= n; i++) {
    int minn = 2000000000, minp;
    for (int j = 1; j <= n; j++)
      if (minn > p[j] && bo[j] == 0) minp = j, minn = p[j];
    bo[minp] = 1;
    for (int j = 1; j <= n; j++)
      if (bo[j] == 0 && p[j] > a[minp][j]) {
        fa[j] = minp;
        dep[j] = dep[minp] + 1;
        p[j] = a[minp][j];
      }
  }
  for (int i = 1; i < n; i++)
    for (int j = i + 1; j <= n; j++) {
      int x = i, y = j;
      if (dep[x] < dep[y]) swap(x, y);
      if (a[x][y] > max(a[fa[x]][x], a[fa[x]][y])) {
        puts("NOT MAGIC");
        return 0;
      }
    }
  puts("MAGIC");
}
