#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };
int ans(char c,bool one){
	if ('2' <= c&&c <= '9')
		return c - '0';
	else if (c == 'A')
		return (one ? 1 : 11);
	else
		return 10;
}

int main() {
	int n;
	cin >> n;
	REP(game_num, n){
		char cards[10];
		for (int i = 0; i < 10; i++){
			cin >> cards[i];
		}

		int sum = 0;
		bool herashita = false;
		bool one = false;
		for (int i = 0; i < 2; i++){
			int a = ans(cards[i], one);
			if (a == 11)one = true;
			sum +=a;
		}
		if (sum == 21){
			cout << "blackjack" << endl;
			continue;
		}
		else if (sum == 17&&!one ||sum>=18){
			cout << sum << endl;
			continue;
		}

		REP(i, 8){
			int a = ans(cards[i+2], one);
			if (a == 11)one = true;
			sum += a;
			if (sum >= 22){
				if (!one){
					cout << "bust" << endl;
					break;
				}
				sum -= 10;
				one = false;
			}
			if (17 <= sum){
				if (sum == 17 && one)
					continue;
				cout << sum << endl;
				break;
			}
		}
	}
}