#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b)	for (int i(a); i <= (b); ++i)

#define dec(i, a, b)	for (int i(a); i >= (b); --i)

#define MP		make_pair

#define fi		first

#define se		second

typedef pair <int, pair <int, int> > PII;

const int N = 2510;

int a[N][N];

int cnt, now;

int n;

PII c[N * N];

bitset <N> f[N], tmp;

int main(){

	scanf("%d", &n);

	rep(i, 1, n) rep(j, 1, n) scanf("%d", a[i] + j);

	rep(i, 1, n - 1) rep(j, i + 1, n) if (a[i][j] ^ a[j][i]) return 0 * puts("NOT MAGIC");

	rep(i, 1, n) if (a[i][i]) return 0 * puts("NOT MAGIC");

	rep(i, 1, n) rep(j, 1, n) c[++cnt] = MP(a[i][j], MP(i, j));

	sort(c + 1, c + cnt + 1);

	now = 1;

	rep(i, 1, cnt){

		for (; now < i && c[now].fi < c[i].fi; ){

			f[c[now].se.fi][c[now].se.se] = 1;

			f[c[now].se.se][c[now].se.fi] = 1;

			++now;

		}

		tmp = f[c[i].se.fi] & f[c[i].se.se];

		if (tmp.any()) return 0 * puts("NOT MAGIC");

	}

	return 0 * puts("MAGIC");

}