#include <bits/stdc++.h>
using namespace std;
const int DIM = 2505;
bitset<DIM> oki[DIM];
int mat[DIM][DIM];
pair<int, pair<int, int>> arr[DIM * DIM];
int main(void) {
  int n, m = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      scanf("%d", &mat[i][j]);
      arr[++m] = make_pair(mat[i][j], make_pair(i, j));
      if (i == j and mat[i][j]) {
        printf("NOT MAGIC\n");
        return 0;
      }
      if (i > j and mat[i][j] != mat[j][i]) {
        printf("NOT MAGIC\n");
        return 0;
      }
    }
  }
  sort(arr + 1, arr + m + 1);
  for (int i = 1, j = 1; i <= m;) {
    for (; j <= m and arr[i].first == arr[j].first; ++j) {
      if ((oki[arr[j].second.first] & oki[arr[j].second.second]).any()) {
        printf("NOT MAGIC\n");
        return 0;
      }
    }
    for (; i < j; ++i) oki[arr[i].second.first][arr[i].second.second] = true;
  }
  printf("MAGIC\n");
  return 0;
}
