#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#define mems(x, v) memset(x, v, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef long double wisdom;

int a[100005];
int main() {
	int n; ll cnt = 0, ans = 0; scanf("%d", &n);
	for (int i = 1, x; i <= n; i++) scanf("%d", &a[i]), cnt += a[i];
	if (!cnt) return puts("Donkey"), 0;
	sort(a + 1, a + n + 1);
	for (int i = 1; i < n; i++) ans += a[i];
	puts(ans >= n ? "Puss in Boots" : "Donkey");
	return 0;
}