#include <bits/stdc++.h>
using namespace std;
int const maxn = (int)1e5 + 111;
int const inf = (1 << 30) - 1;
int v[6], n = 6;
int main() {
  for (int i = 0; i < n; i++) scanf("%d", v + i);
  sort(v, v + n);
  if (v[0] == v[n - 1])
    printf("Elephant\n");
  else {
    set<int> second;
    map<int, int> m;
    for (int i = 0; i < n; i++) {
      second.insert(v[i]);
      m[v[i]]++;
    }
    vector<int> a;
    bool ok = 0;
    for (typeof(second.begin()) it = second.begin(); it != second.end(); it++) {
      int x = *it;
      ok |= m[x] >= 4;
      if (m[x] == 4) continue;
      a.push_back(x);
    }
    if ((int)a.size() > 2 || (int)a.size() < 1 || !ok)
      printf("Alien\n");
    else if ((int)a.size() == 1)
      printf("Elephant\n");
    else
      printf("Bear\n");
  }
  return 0;
}
