#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "-funroll-loops", "-fdelete-null-pointer-checks")
#pragma GCC target("ssse3", "sse3", "sse2", "sse", "avx2", "avx")
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const int sz = 2501;
int a[sz][sz];
pair<int, pair<int, int>> pos[sz * sz];
int n;
bitset<sz> mem[sz];
inline int readInt() {
  int x = 0;
  char ch = getchar();
  bool s = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') s = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return s ? x : -x;
}
int main() {
  n = readInt();
  int tot = 0, val;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      a[i][j] = readInt();
      pos[tot++] = {a[i][j], {i, j}};
    }
  }
  sort(pos, pos + n * n, greater<pair<int, pair<int, int>>>());
  vector<vector<pair<int, int>>> vals;
  vector<pair<int, int>> cur{pos[0].second};
  for (int i = 1; i < n * n; i++) {
    if (pos[i].first != pos[i - 1].first) {
      vals.push_back(cur);
      cur.clear();
    }
    cur.push_back(pos[i].second);
  }
  vals.push_back(cur);
  for (vector<pair<int, int>> v : vals) {
    for (pair<int, int> ii : v) mem[ii.first][ii.second] = 1;
    for (pair<int, int> ii : v) {
      if ((mem[ii.first] | mem[ii.second]).count() != n) {
        printf("NOT MAGIC\n");
        return 0;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (a[i][i] != 0) {
      printf("NOT MAGIC\n");
      return 0;
    }
  }
  printf("MAGIC\n");
  return 0;
}
