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 Rust (1.15.1) (judge verdict: Wrong Answer)

// https://atcoder.jp/contests/abc147/tasks/abc147_f
//
#![allow(unused_imports)]
use std::io::*;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

type Line = (i64, i64); // first, num

fn nth(x: i64, d: i64, n: i64) -> i64 {
    x + d * (n-1)
}

fn solve(n: i64, x: i64, d: i64) -> i64 {
    if d == 0 {
        if x == 0 {
            return 1i64;
        }
        return n+1;
    } else if d < 0 {
        return solve(n, -x, -d);
    }

    let mut rec = vec![];
    for k in 1..n+1 {
        let mut from = (nth(x, d, 1) + nth(x, d, k)) * k / 2;
        let mut to = (nth(x, d, n-k+1) + nth(x, d, n)) * k / 2;
        rec.push((from, to));
    }
    rec.sort_by_key(|&(f, t)| (mo(f, d), f));
    // debug!(rec);

    let mut ans = 0;
    let mut fr = 0;
    while (fr as i64) < n {
        let mut to = fr+1;
        let mut lastf = rec[fr].0;
        let mut lastt = rec[fr].1;
        while (to as i64) < n && mo(rec[fr].0, d) == mo(rec[to].0, d) {
            if lastf <= rec[to].0 && rec[to].0 <= lastt {
                lastt = max(lastt, rec[to].1);
            } else {
                ans += (lastt - lastf) / d + 1;
                lastf = rec[to].0;
                lastt = rec[to].1;
            }
            to += 1;
        }
        ans += (lastt - lastf) / d + 1;
        fr = to;
    }
    return ans+1;
}

fn mo(a: i64, d: i64) -> i64 {
    if a < 0 {
        (d-mo(-a, d)) % d
    } else {
        a % d
    }
}

fn main() {
    input! {
        n: i64, x: i64, d: i64
    };

    println!("{}", solve(n, x, d));
}