#include <iostream>

#include <cmath>

#include <algorithm>

#include <vector>

#include <set>

#include <string>

#include <iomanip>

#include <cstring>

#include <ctime>

#include <unordered_map>

using namespace std;

const int o = 1e5 + 10;

long long a[o],t=0,b[o];

int main()

{

long long n;

cin >> n;

long long m,k;

cin >>m>>k;

int p = m % 2;

while (m >= 2 * k && p != 1)

{

t += 1;

m /= 2;

p = m % 2;

}

t *= n;

if (t % 2 == 1)

{

cout << "Bing";

}

else

{

cout << "Bong";

}

}