#include <bits/stdc++.h>
using namespace std;
void init_ios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
const int N = 2505;
int n, a[N][N];
bitset<N> yolo[N], k;
vector<pair<int, int> > v;
bool cmp(pair<int, int> x, pair<int, int> y) {
  return a[x.first][x.second] < a[y.first][y.second];
}
int main() {
  init_ios();
  cin >> n;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      cin >> a[i][j];
      if (i <= j) v.push_back({i, j});
    }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      if (a[i][j] != a[j][i] || a[i][i] != 0) {
        cout << "NOT MAGIC\n";
        return 0;
      }
    }
  sort(v.begin(), v.end(), cmp);
  for (int i = 0; i < v.size(); ++i) {
    int id = i;
    while (id < (int)v.size() - 1 &&
           a[v[id].first][v[id].second] == a[v[id + 1].first][v[id + 1].second])
      ++id;
    for (int j = i; j <= id; ++j)
      if ((yolo[v[j].first] & yolo[v[j].second]) != k) {
        cout << "NOT MAGIC\n";
        return 0;
      }
    for (int j = i; j <= id; ++j)
      yolo[v[j].first][v[j].second] = yolo[v[j].second][v[j].first] = 1;
    i = id;
  }
  cout << "MAGIC\n";
}
