#include <bits/stdc++.h>

using namespace std;

int g[200][200];
int vis[200];
int pc, ec;
int n, m;

void dfs(int u)
{
	if (vis[u]) return;
	vis[u] = 1;
	pc++;
	for (int v = 1; v <= n; v++) {
		if (g[u][v]) {
			ec++;
			dfs(v);
		}
	}
}

int f[200][200][2];
int gao(int odd, int even, int tot)
{
	if (odd + even == 1) return 0;
	int &res = f[odd][even][tot];
	if (res != -1) return res;
	if (tot && !gao(odd, even, tot ^ 1)) return res = 1;
	if (odd >= 2 && !gao(odd - 2, even + 1, tot)) return res = 1;		//odd * odd = odd - 1
	if (even >= 2 && !gao(odd, even - 1, tot ^ 1)) return res = 1;		//even * even = even - 1
	if (odd >= 1 && even >= 1 && !gao(odd, even - 1, tot ^ 1)) return res = 1;	//odd * even = even - 1
	return res = 0;
}

int main()
{
	freopen("points.in", "r", stdin);
	freopen("points.out", "w", stdout);
	while (scanf("%d%d", &n, &m) != EOF) {
		memset(g, 0, sizeof(g));
		for (int i = 0; i < m; i++) {
			int u, v;
			scanf("%d%d", &u, &v);
			g[u][v] = g[v][u] = 1;
		}
		memset(vis, 0, sizeof(vis));
		int odd = 0, even = 0, tot = 0;
		for (int i = 1; i <= n; i++) {
			if (vis[i]) continue;
			pc = 0, ec = 0;
			dfs(i);
			ec /= 2;
			if (pc & 1) odd++; else even++;
			tot ^= (pc * (pc - 1) / 2 - ec) & 1;
		}
		memset(f, -1, sizeof(f));
		puts(gao(odd, even, tot) ? "Andrew" : "Betty");
	}
	return 0;
}