#include <bits/stdc++.h>
using namespace std;
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int findGCD(long long a[], long long n) {
  int result = a[0];
  for (int i = 1; i < n; i++) {
    result = gcd(a[i], result);
    if (result == 1) {
      return 1;
    }
  }
  return result;
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long a[6];
  for (int i = 0; i < int(6); i++) cin >> a[i];
  sort(a, a + 6);
  if (a[0] == a[3]) {
    if (a[4] == a[5])
      cout << "Elephant" << endl;
    else
      cout << "Bear" << endl;
  } else if (a[1] == a[4])
    cout << "Bear" << endl;
  else if (a[2] == a[5]) {
    if (a[0] == a[1])
      cout << "Elephant" << endl;
    else
      cout << "Bear" << endl;
  } else {
    cout << "Alien" << endl;
  }
  return 0;
}
