#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int N = 105;
int n;
int a[N][N], b[N][N];

int inverse(ll a, int Mod) {
	ll res = 1;
	for (int b = Mod - 2; b; b >>= 1) {
		if (b & 1) res = res * a % Mod;
		a = a * a % Mod;
	}
	return res;
}

bool ok(int Mod) {
	rep (i, n) rep (j, n) b[i][j] = (a[i][j] % Mod + Mod) % Mod;
	ll det = 1;
	rep (i, n) {
		for (int j = i + 1; j < n && !b[i][i]; j++) {
			if (b[j][i]) {
				for (int k = i; k < n; k++)
					swap(b[i][k], b[j][k]);
				det = (-det + Mod) % Mod;
				break;
			}
		}
		if (!b[i][i]) return 0;
		det = (det * b[i][i] % Mod + Mod) % Mod;
		ll inv = inverse(b[i][i], Mod);
		for (int j = i + 1; j < n; j++) {
			if (b[j][i]) {
				ll mul = inv * b[j][i] % Mod;
				for (int k = i; k < n; k++) {
					b[j][k] = ((b[j][k] - mul * b[i][k]) % Mod + Mod) % Mod;
				}
			}
		}
	}
	return (det == 1) || (det == Mod - 1);
}

int main() {
	scanf("%d", &n);
	rep (i, n) rep (j, n) scanf("%d", &a[i][j]);
	if (ok(1000000007) && ok(1000000009) && ok(1000003)) {
		puts("Death");
	} else {
		puts("Power of magic saves lives");
	}
}