Problem:
 Score : 100 points    Problem Statement Given are three integers A_1 , A_2 , and A_3 .  If A_1+A_2+A_3 is greater than or equal to 22 , print bust ; otherwise, print win .      Constraints  1 \leq A_i \leq 13 \ \ (i=1,2,3)  All values in input are integers.         Input Input is given from Standard Input in the following format:  A_1  A_2  A_3       Output If A_1+A_2+A_3 is greater than or equal to 22 , print bust ; otherwise, print win .        Sample Input 1 5 7 9      Sample Output 1 win  5+7+9=21 , so print win .       Sample Input 2 13 7 2      Sample Output 2 bust  13+7+2=22 , so print bust .

Solution (Python):
a,b,c = map(int,input().split())

if a+b+c >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def main():
    a, b, c = LI()
    if a+b+c >= 22:
        print("bust")
    else:
        print("win")

main()

Solution (Python):
A1,A2,A3 = map(int,input().split())
if A1+A2+A3>=22:
    print('bust')
else:
    print('win')

Solution (Python):
A1, A2, A3 = map(int, input().split())
print('bust' if A1 + A2 + A3 >= 22 else 'win')

Solution (Python):
a,b,c=map(int,input().split())
s=a+b+c
if s>=22:
  print("bust")
else:
  print("win")

Solution (Python):
a, b, c = map(int, input().split())

if a+b+c >= 22:
    ans = 'bust'
else:
    ans = 'win'

print(ans)

Solution (Python):
a1,a2,a3=map(int,input().split())

if a1+a2+a3>=22:
  print('bust')
else:
  print('win')

Solution (Python):
K = [int(x) for x in input().split()]
if sum(K) <= 21:
  print("win")
else:
  print("bust")

Solution (Python):
X,Y,Z = map(int, input().split())

if X+Y+Z >= 22:
  print("bust")
else:
  print("win")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A = LIST()

print("bust" if sum(A)>=22 else "win")

Solution (Python):
a1,a2,a3 = map(int,input().split())
if a1+a2+a3 >=22:
    print("bust")
else:
    print("win")

Solution (Python):
a, b, c = [int(s) for s in input().split()]
if a + b + c >= 22:
  print('bust')
else:
  print('win')

Solution (Python):
a,b,c = map(int,input().split())

if a+b+c >= 22:
  print("bust")
else:
  print("win")

Solution (Python):
a = list(map(int, input().split()))
if sum(a) >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
a = sum(list(map(int, input().split())))
if a >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
A = list(map(int,input().split()))
if sum(A) >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    A = string_to_int(inputs[0])
    if sum(A) >= 22:
        return "bust"
    return "win"


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
a, b, c = map(int, input().split())
if(a + b + c >= 22):
    print("bust")
else:
    print("win")

Solution (Python):
a,b,c=map(int,input().split())
print("bust" if a+b+c>=22 else "win")

Solution (Python):
A = list(map(int, input().split()))
if sum(A) >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
a,b,c=map(int,input().split())
if a+b+c>=22:print("bust")
else:print("win")

Solution (Python):
a,b,c = map(int,input().split())

if a+b+c >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
s = sum(map(int, input().split()))
if s>21:
    print("bust")
else:
    print("win")

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

a1,a2,a3 = LI()

if a1+a2+a3 >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
a,b,c=map(int,input().split())
if a+b+c>=22:
	print("bust")
else:
	print("win")

Solution (Python):
A, B, C = [int(i) for i in input().split()]
print('bust' if A + B + C >= 22 else 'win')

Solution (Python):
a, b, c = [int(_) for _ in input().split()]
if a + b + c >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
a = sum([int(i) for i in input().split()])

if a>=22:
    print("bust")
else:
    print("win")

Solution (Python):
A1, A2, A3 = map(int, input().split())
print('win' if A1 + A2 + A3 <= 21 else 'bust')

Solution (Python):
A = list(map(int, input().split()))
print('bust' if sum(A)>21 else 'win')

Solution (Python):
print('bust' if sum(map(int, input().split())) >= 22 else 'win')

Solution (Python):
A_list = list(map(int, input().split()))

if (sum(A_list)) >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
A = [int(i) for i in input().split()]
if sum(A) >=22:
    print("bust")
else:
    print("win")

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

a,b,c = m()

if a + b + c >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
a,b,c = map(int,input().split())
if a+b+c>=22:
  print("bust")
else:
  print("win")

Solution (Python):
a = list(map(int, input().split()))
if sum(a) >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
a,b,c=map(int,input().split())
print('bust' if a+b+c>21 else 'win')

Solution (Python):
a1, a2, a3 = map(int, input().split())

if a1+a2+a3>=22:
    print('bust')
else:
    print('win')

Solution (Python):
A1, A2, A3 = map(int, input().split())
print("bust" if A1 + A2 + A3 >= 22 else "win")

Solution (Python):
if sum(list(map(int, input().split()))) >= 22: print('bust')
else: print('win')

Solution (Python):
A1,A2,A3=map(int,input().split())
f=A1+A2+A3>=22

print('bust' if f else 'win')

Solution (Python):
A,B,C = map(int, input().split())
if A+B+C >= 22:
  print("bust")
else:
  print("win")

Solution (Python):
a, b, c = map(int, input().split())

ans = a+b+c
if ans >= 22:
    print("bust")
else:
    print("win")

Solution (Python):

A = list(map(int, input().split()))
print("bust" if sum(A) >= 22 else "win")

Solution (Python):
from sys import stdin

li = list(map(int,stdin.readline().rstrip().split()))

if sum(li) > 21:
    print("bust")
else:
    print("win")

Solution (Python):
A = list(map(int, input().split()))
if sum(A) >= 22:
  print("bust")
else:
  print("win")

Solution (Python):
a, b, c = map(int, input().split())
print("bust" if a + b + c >= 22 else "win")

Solution (Python):
if sum([int(i) for i in input().split()]) >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
a1, a2, a3 = map(int, input().split())

if a1 + a2 + a3 >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
a, b, c = (int(i) for i in input().split())
if a+b+c>=22:
    print("bust")
else:
    print("win")

Solution (Python):
a,b,c=map(int,input().split())
print('bust' if a+b+c>=22 else 'win')

Solution (Python):
a,b,c = map(int,input().split())
if a+b+c < 22:
  print("win")
else:
  print("bust")

Solution (Python):
a,b,c = map(int,input().split())
if a+b+c >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
S = list(map(int, input().split()))
if sum(S) >= 22:
	print("bust")
else:
	print("win")

Solution (Python):
a, b, c = map(int, input().split())
print('bust' if a+b+c >= 22 else 'win')

Solution (Python):

import sys, math, itertools, heapq, collections, bisect, string
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**7)
inf = float('inf')
mod = 10**9+7
ans = inf ;count = 0 ;pro = 1

a,b,c=map(int,input().split())
S=a+b+c
if S>=22:
    print("bust")
else:
    print("win")

Solution (Python):
a, b, c = map(int, input().split())
if a+b+c >= 22:
  print('bust')
else:
  print('win')

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)

    a = list(map(int, input().split()))
    print('bust' if sum(a) > 21 else 'win')


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = map(int, input().split())
if a+b+c>=22:
  print('bust')
else:
  print('win')

Solution (Python):
a,b,c = map(int,input().split())

print('bust' if a+b+c >= 22 else 'win')

Solution (Python):
a,b,c = map(int,input().split())
print('bust' if a+b+c >= 22 else 'win')

Solution (Python):
A = list(map(int, input().split()))

if sum(A) >= 22:
  print('bust')
else:
  print('win')

Solution (Python):
a1 ,a2 ,a3 = map(int, input().split())

if a1 + a2 + a3 >= 22:
    print('bust')
else:
    print('win')

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



A1,A2,A3 = II()

if A1+A2+A3>=22:
    print('bust')
else:
    print('win')

Solution (Python):
a,b,c=map(int,input().split())
if a+b+c>=22:
    print("bust")
else:
    print("win")

Solution (Python):
a,b,c = map(int, input().split())
if a+b+c >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    a, b, c = list(map(int, readline().split()))
    print("bust" if a + b + c >= 22 else "win")


if __name__ == '__main__':
    solve()

Solution (Python):
a = list(map(int, input().split()))
if sum(a) >= 22:
  print('bust')
else:
  print('win')

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a=sum(map(int,input().split()))
    print("bust" if(a>=22) else "win")
resolve()

Solution (Python):
a, b, c = input().split()
a, b, c = int(a), int(b), int(c)

if a + b + c > 21:
  print("bust")
else:
  print("win")

Solution (Python):
a, b, c = map(int,input().split())
if a + b + c >= 22:
    print("bust")
else:
    print("win")

Solution (Python):
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7




A = list(map(int, sys.stdin.buffer.readline().split()))
s = A[0] + A[1] + A[2]
if s >= 22:
    print('bust')
else:
    print('win')

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b,c = LI()
    if a+b+c >= 22:
        print("bust")
    else:
        print("win")
    return


if __name__ == "__main__":
    solve()

Solution (Python):
a,b,c = map(int,input().split())
if (a + b + c) >= 22:
    print('bust')
else:
    print('win')