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 in Scala (2.11.7) (judge verdict: Runtime Error)

object Main extends App {
  val n = io.StdIn.readLine().toInt
  
  def readData(i: Int, acc: Map[Int, Set[(Int, Int)]]): Map[Int, Set[(Int, Int)]] = if (i > n)
  	acc
  else {
    val a = io.StdIn.readLine().toInt
    val testimony = Iterator.continually(io.StdIn.readLine()).take(a).map(_.split(' ').map(_.toInt)).map {
      case Array(x, y) => (x, y)
    }.toSet
    readData(i + 1, acc + (i -> testimony))
  }
  
  val testimonies = readData(1, Map.empty)
  
  val all = 1 to n
  
  def checkConsistent(unkinds: Set[Int]): Boolean = {
    val honests = all.toSet -- unkinds
    honests.forall { i =>
      	testimonies.getOrElse(i, Set.empty).forall {
          case (x, 0) => unkinds.contains(x)
          case (x, 1) => honests.contains(x)
          case z => throw new Exception(s"予想しない値です: ${z}")
        }
    }
  }
  
  def findUnkinds(unkinds: Int): Int = if (unkinds == n)
  	n
  else {
  	val consistent = all.combinations(unkinds).exists { candidates =>
      checkConsistent(candidates.toSet)
    }
    if (consistent)
    	unkinds
    else
    	findUnkinds(unkinds + 1)
  }
  
  val answer = findUnkinds(0)
  
  println(n - answer)
}