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.



Sample input:
5 7 9


Sample output:
win

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A1,A2,A3=map(int,input().strip().split())

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())

value=A+B+C
if value<=21 :
    print('win')
else:
    print('bust')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A1,A2,A3=map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A+B+C >= 22:
  print('bust')
  
else:
  print('win')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=map(int,input().split());print("bwuisnt"[sum(a)<22::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('win' if sum(map(int,input().split())) <= 21 else 'bust')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A = list(map(int,stdin.readline().strip().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 初期入力
A1,A2,A3 = (int(x) for x in input().split(" "))

#
if A1 + A2 + A3 <=21:
    print("win")
else:
    print("bust")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A+B+C >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A1,A2,A3=map(int,input().split())

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from fractions import gcd                    # for Python3.4.3


def main():
    mod = 10000007                  # 10^9+7
    inf = float('inf')
    input = sys.stdin.readline      # 改行文字が残ることに注意
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def ii():  return int(input())
    def mi():  return map(int, input().rstrip().split())
    def lmi(): return list(map(int, input().rstrip().split()))
    def li():  return list(input().rstrip())
    
    
    a, b, c = mi()
    print('bust') if a+b+c>=22 else print('win')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = sum(int(x) for x in input().split())
print('bust' if t >= 22 else 'win')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a_1, a_2, a_3 = map(int, readline().split())
if a_1 + a_2 + a_3 >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
*A, = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

total = sum(A)

answer = 'bust' if total >= 22 else 'win'

print(answer)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
b=a[0]+a[1]+a[2]
if b >=22:
  print("bust")
else:
  print("win")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import Counter, deque

INF = float('inf')

""" Input
S = input()
N = int(input())
N, A, B = map(int, input().split())
D = [int(input()) for _ in range(N)]
"""

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = map(int, input().split())
print('win' if sum(A)<22 else 'bust')

Submission status: Accepted

Solution code:
print('bwuisnt'[sum(map(int, input().split())) < 22::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = map(int, input().split())
if sum(a) <= 21:
  print('win')
else:
  print('bust')

Submission status: Accepted

Solution code:
a = map(int, input().split())
if sum(a) <= 21:
    print('win')
else:
    print('bust')

Submission status: Accepted

Solution code:
ns = map(int, input().split())
if sum(ns) <= 21:
    print('win')
else:
    print('bust')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A1, A2, A3 = [int(x) for x in stdin.readline().rstrip().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    A1, A2, A3 = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 147: A – Blackjack
total = sum(map(int, input().split()))
print('win' if total <= 21 else 'bust')

Submission status: Accepted

Solution code:
a123=input().rstrip().split(" ")
a1=int(a123[0])
a2=int(a123[1])
a3=int(a123[2])
if a1+a2+a3>=22:
    print("bust")
else:
    print("win")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input().split()
n_list = [int(i) for i in n]
if sum(n_list) >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
print('bust' if sum([int(x) for x in input().split()]) >= 22 else 'win')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
print("bust" if a[0]+a[1]+a[2] >= 22 else "win")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[int(i) for i in input().split()]
if a[0]+a[1]+a[2]<=21:
    print("win")
else:
    print("bust")

Submission status: Accepted

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

score = sum(A)

if score > 21:
    ans = 'bust'
else:
    ans = 'win'

print(ans)

Submission status: Accepted

Solution code:
base = input().split()
if int(base[0])+int(base[1])+int(base[2])>21:
    print("bust")
else:
    print("win")

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

total = sum(lr())
print('bust' if total >= 22 else 'win')
# 44

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A+B+C>=22:
    print('bust')
else:
    print('win')

Submission status: Accepted

Solution code:
import sys

*a, = map(int, sys.stdin.readline().split())

def main():
    ans = 'bust' if sum(a) >= 22 else 'win'
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a1,a2,a3=map(int,input().split())
print('win' if a1+a2+a3<22 else 'bust')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().split())

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

Submission status: Accepted

Solution code:
B1, A2, A3 = map(int, input().split())
C = B1 + A2 + A3
if C <= 21:
  print('win')
if C >= 22:
  print('bust')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

a,b,c = get_nums_l()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
sum1=0
for i in map(int,input().split()):
  sum1+=i
  
a='bust' if sum1>=22 else 'win'
print(a)

Submission status: Accepted

Solution code:
n=input().split()
a=int(n[0])
b=int(n[1])
c=int(n[2])
if a+b+c<=21:
      print("win")
else:
     print("bust")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B,C = map(int,input().split())

if A+B+C>21:
  print("bust")
else:
  print("win")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a1 + a2 + a3 <= 21:
    print('win')
else:
    print('bust')

Submission status: Accepted

Solution code:
A1, A2, A3 = [int(i) for i in input().split()]
if A1+A2+A3 >= 22:
  print("bust")
else:
  print("win")

Submission status: Accepted

Solution code:
def get_ints():
    return map(int, input().split())

a = list(get_ints())
print('bust' if sum(a) >= 22 else 'win')

Submission status: Accepted

Solution code:
S,T,D = map(int,input().split())
#S,T = input().split()
#S = input()
if 22 <= S+T+D:
  print('bust')
else:
  print('win')

Submission status: Accepted

Solution code:
ans = 0
for i in input().split():
  ans += int(i)
print("win" if ans <= 21 else "bust")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
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
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

a = LIST()
print('bust' if sum(a) >= 22 else 'win')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
out = A + B + C

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

Submission status: Accepted

Solution code:
data = input().split()
 
a = int(data[0])
b = int(data[1])
c = int(data[2])
 
if a + b + c <= 21:
  print("win")
else:
  print("bust")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))

if a[0]+a[1]+a[2] >= 22:
	print("bust")
else:
	print("win")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a1, a2, a3 = list(map(int, input().split()))
print("win" if (a1+a2+a3) <= 21 else "bust")

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if A+B+C<=21:
  print("win")
else:
  print("bust")

Submission status: Accepted

Solution code:
a1, a2, a3 = map(int, input().split())
point = a1 + a2 + a3
if point < 22:
    print('win')
else:
    print('bust')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

else:
    print('win')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    a1,a2,a3 = map(int, input().split())
    if a1+a2+a3 >= 22:
        print('bust')
    else:
        print('win')
    

main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,c = list(map(int,input().split()))
ret = "win"
if a+b+c >= 22:
    ret = "bust"
print(ret)

Submission status: Accepted

Solution code:
a = [list(map(int, inp.split())) for inp in open(0)][0]
if sum(a) < 22:
  print('win')
else:
  print('bust')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A+B+C>21:
  ans = 'bust'
else:
  ans = 'win'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A1,A2,A3 = map(int,input().split())

if A1 + A2 + A3 >= 22:
	answer = "bust"
else:
	answer = "win"

print(answer)

Submission status: Accepted

Solution code:
A1, A2, A3 = map(int, input().split())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print("bust" if sum(map(int, input().split())) >= 22 else "win")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9 +7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

a,b,c = inputIL()

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print('bwuisnt'[a+b+c<22::2])

Submission status: Accepted

Solution code:
*a,=map(int,open(0).read().split());print('bwuisnt'[sum(a)<22::2])

Submission status: Accepted

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

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

else:
    print('win')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

Submission status: Accepted

Solution code:
a=map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

if a+b+c<=21:
    print('win')
else:
    print('bust')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
count=0
for i in a:
    count+=i
if count < 22:
    print("win")
else:
    print("bust")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

A, B, C = map(int, input().split())

if A + B + C >= 22:
    print('bust')
else:
    print('win')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np
# import math
# mod = 10**9 + 7

# n = int(input())

# s = deque(input())
# q = int(input())

# a, b = map(int, input().split())
a = list(map(int, input().split()))

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

Submission status: Accepted

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