#include <queue>
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <iomanip>
#include <cstdio>
#define rep(i, n) for(long long i = 0;(i) < (n);(i)++)
using namespace std;
using ll = long long;
const ll mod = 1000000007;

int N;
int a[10];

int main() {
	cin >> a[0] >> a[1] >> a[2];
	if (a[0] + a[1] + a[2] <= 21)
	{
		cout << "win" << endl;
	}
	else
	{
		cout << "bust" << endl;
	}
	return 0;
}