#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 1e9;
long long powm(long long a, long long p, long long m) {
  long long r = 1 % m;
  while (p) {
    if (p & 1) r = r * a % m;
    p >>= 1;
    a = a * a % m;
  }
  return r;
}
int main() {
  int l[6], ans = 0;
  for (int i = 0; i < (6); ++i) scanf("%d", l + i);
  sort(l, l + 6);
  if (l[0] == l[3])
    ans = 1 + (l[4] != l[5]);
  else if (l[1] == l[4])
    ans = 1 + (l[0] != l[5]);
  else if (l[2] == l[5])
    ans = 1 + (l[0] != l[1]);
  char s[3][50] = {"Alien", "Elephant", "Bear"};
  puts(s[ans]);
  return 0;
}
