#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5007;
vector<pair<int, pair<int, int> > > val;
int fa[MAXN], n, a[MAXN][MAXN];
int root(int u) {
  if (fa[u] == -1) return u;
  return fa[u] = root(fa[u]);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      cin >> a[i][j], val.push_back({a[i][j], {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]) return cout << "NOT MAGIC", 0;
  sort(val.begin(), val.end());
  for (int i = 1; i <= 2 * n; ++i) fa[i] = -1;
  vector<pair<int, int> > cur;
  cur.push_back(val[0].second);
  for (int i = 1; i < n * n; ++i) {
    if (val[i].first != val[i - 1].first) {
      for (auto it : cur) {
        int x = it.first, y = it.second;
        if (x == y) continue;
        int u = root(x), v = root(y);
        if (u == v) return cout << "NOT MAGIC", 0;
      }
      for (auto it : cur) {
        int x = it.first, y = it.second;
        int u = root(x), w = root(y + n);
        if (u != w) fa[u] = w;
      }
      cur.clear();
    }
    cur.push_back(val[i].second);
  }
  for (auto it : cur) {
    int x = it.first, y = it.second;
    if (x == y) continue;
    int u = root(x), v = root(y);
    if (u == v) return cout << "NOT MAGIC", 0;
  }
  cout << "MAGIC";
  return 0;
}
