#include <bits/stdc++.h>
using namespace std;
const int N = 2500 + 77;
int n, a[N][N], F[N][N], T[N], W[N];
bool M[N];
vector<int> adj[N];
void dfs(int x, int v, int prev = -1) {
  for (int u : adj[v])
    if (u != prev) F[x][u] = max(F[x][v], F[v][u]), dfs(x, u, v);
}
int main() {
  memset(T, 63, sizeof(T));
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) scanf("%d", &a[i][j]);
  for (int i = 1; i <= n; ++i)
    if (a[i][i] != 0) return !printf("NOT MAGIC\n");
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (a[i][j] != a[j][i]) return !printf("NOT MAGIC\n");
  M[1] = 1;
  for (int i = 2; i <= n; ++i) T[i] = a[i][1], W[i] = 1;
  for (int t = 2; t <= n; ++t) {
    int best = 1;
    int v = 0;
    for (int i = 1; i <= n; ++i)
      if ((!M[i]) && (T[i] < T[best] || M[best])) best = i, v = W[i];
    F[best][v] = F[v][best] = a[v][best];
    adj[best].push_back(v);
    adj[v].push_back(best);
    for (int i = 1; i <= n; ++i)
      if (T[i] > a[best][i]) T[i] = a[best][i], W[i] = best;
    M[best] = 1;
  }
  for (int i = 1; i <= n; ++i) dfs(i, i);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (a[i][j] != F[i][j]) return !printf("NOT MAGIC\n");
  printf("MAGIC\n");
  return 0;
}
