#include <bits/stdc++.h>
using namespace std;
using ll = long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
bitset<2500> B[2500];
bitset<2500> C;
int A[2500][2500];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, pair<int, int>>> V;
  bool w = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int a;
      cin >> a;
      A[i][j] = a;
      if (i == j && a != 0) w = 0;
      if (i > j && a != A[j][i]) w = 0;
      if (j > i) {
        V.push_back({a, {i, j}});
      }
    }
  }
  sort((V).begin(), (V).end());
  while (!V.empty()) {
    int cur = V.back().first;
    vector<pair<int, int>> W;
    while (!V.empty() && V.back().first == cur) {
      W.push_back(V.back().second);
      V.pop_back();
    }
    for (auto ww : W) {
      B[ww.first][ww.second] = true;
      B[ww.second][ww.first] = true;
    }
    for (auto ww : W) {
      C = B[ww.first] | B[ww.second];
      if ((int)C.count() < n) {
        w = 0;
      }
    }
  }
  cout << (w ? "MAGIC\n" : "NOT MAGIC\n");
}
