stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295670552341202x):
#include<stdio.h>



int main (){

	int num1, num2, num3;

	num1, num2, num3>=1;

	num1, num2, num3<=13;

	

	

	scanf ("%d %d %d", &num1, &num2, &num3);

	if (num1+num2+num3<=21){

		printf("win");

		

	}else {

		printf ("bust");

	    }

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.3087821370604145x):
#include <stdio.h>



int main()

{

  int num1, num2, num3;

  scanf("%d %d %d", &num1, &num2, &num3);

  (num1 + num2 + num3 >= 22) ? puts("bust") : puts("win");

  return 0;

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.306683293732095x):
#include <stdio.h>



int main()

{

  int num1, num2, num3;

  scanf("%d %d %d", &num1, &num2, &num3);

  (num1 + num2 + num3 >= 22) ? puts("bust") : puts("win");

  return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.2977566781827115x):
#include <stdio.h>



int main(){

	int a1, a2, a3;

	

	scanf("%d %d %d", &a1, &a2, &a3);

	if (a1 + a2 + a3 >= 22){

		printf("bust\n");	

	}

	else {

		printf("win\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295662193803433x):
#include <stdio.h>



int main(){

	int a1, a2, a3;

	

	scanf("%d %d %d", &a1, &a2, &a3);

	if (a1 + a2 + a3 >= 22){

		printf("bust\n");	

	}

	else {

		printf("win\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.297289662883253x):
#include <stdio.h>

int main()

{

	int A1,A2,A3;

	int i;

	scanf("%d %d %d",&A1,&A2,&A3);

	i=A1+A2+A3;

	if(i>=22)

	{

		printf("bust");

	}

	else

	{

		printf("win");

	}

	return 0;

	

	

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295195363139909x):
#include <stdio.h>

int main()

{

	int A1,A2,A3;

	int i;

	scanf("%d %d %d",&A1,&A2,&A3);

	i=A1+A2+A3;

	if(i>=22)

	{

		printf("bust");

	}

	else

	{

		printf("win");

	}

	return 0;

	

	

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.2973356452418745x):
#include<stdio.h>

int main() 

{

	int a, b, c, d;

	scanf("%d %d %d", &a, &b, &c);

	d = a + b + c;

    if(d>=22){

    	printf("bust\n");

	}

	else{

		printf("win\n");

	}	

return 0;	

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295241327319263x):
#include<stdio.h>

int main() 

{

	int a, b, c, d;

	scanf("%d %d %d", &a, &b, &c);

	d = a + b + c;

    if(d>=22){

    	printf("bust\n");

	}

	else{

		printf("win\n");

	}	

return 0;	

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.297628600549263x):
#include <stdio.h>

int main(){

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	if(A1+A2+A3<22){

		printf("win\n");

	}else if(A1+A2+A3>=22){

		printf("bust\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295534166805871x):
#include <stdio.h>

int main(){

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	if(A1+A2+A3<22){

		printf("win\n");

	}else if(A1+A2+A3>=22){

		printf("bust\n");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.3087821370604145x):
#include <stdio.h>



int main(){

	

	int num1, num2, num3;

	scanf("%d %d %d", &num1, &num2, &num3);

	(num1 + num2 + num3 >= 22) ? puts("bust") : puts("win");

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.306683293732095x):
#include <stdio.h>



int main(){

	

	int num1, num2, num3;

	scanf("%d %d %d", &num1, &num2, &num3);

	(num1 + num2 + num3 >= 22) ? puts("bust") : puts("win");

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;



int main(){



 int a,b,c;

    cin>>a>>b>>c;

    if(a+b+c < 22){

    cout<<"win\n";}



    else if(a+b+c >= 22){

    cout<<"bust\n";}





}




// Faster C++ solution for the same problem (measured speedup: 5.2977566781827115x):
#include <stdio.h>



int main ()

{	

	int r,s,t;

	

	scanf("%d %d %d", &r, &s, &t);

	

	if(r + s + t >= 22)

{

	printf("bust\n");

}	

	else

{

	printf("win\n");

}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<iomanip>

using namespace std;

int main()

{

          long long int a,b,c;

          cin>>a>>b>>c;

          if((a+b+c)>=22)

          {

                    cout<<"bust\n";

          }

          else

                    cout<<"win\n";

return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.295662193803433x):
#include <stdio.h>



int main ()

{	

	int r,s,t;

	

	scanf("%d %d %d", &r, &s, &t);

	

	if(r + s + t >= 22)

{

	printf("bust\n");

}	

	else

{

	printf("win\n");

}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.311417031641852x):
#include <stdio.h>



int main(){

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	

	A1+A2+A3 >= 22 ? printf("bust") : printf("win");

	

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.311567585945284x):
#include <stdio.h>



int main(){

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	

	A1+A2+A3 >= 22 ? printf("bust") : printf("win");

	

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.372904586767893x):
#include <stdio.h>



int main(){

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	

	A1+A2+A3 >= 22 ? printf("bust") : printf("win");

	

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297356267342256x):
#include <stdio.h>



int main(){

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	

	A1+A2+A3 >= 22 ? printf("bust") : printf("win");

	

	

	

	

	

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.311068529609794x):
#include <stdio.h>

int main()

{

	int A1, A2, A3;

	int Sum;

	scanf("%d %d %d", &A1, &A2, &A3);

	Sum = A1 + A2 + A3;

		if (Sum>=22)

		{

			printf("bust \n");

		}

		else if (Sum<22)

		{

			printf("win \n");

		}

	return 0;

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.311219074034792x):
#include <stdio.h>

int main()

{

	int A1, A2, A3;

	int Sum;

	scanf("%d %d %d", &A1, &A2, &A3);

	Sum = A1 + A2 + A3;

		if (Sum>=22)

		{

			printf("bust \n");

		}

		else if (Sum<22)

		{

			printf("win \n");

		}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.372552050306268x):
#include <stdio.h>

int main()

{

	int A1, A2, A3;

	int Sum;

	scanf("%d %d %d", &A1, &A2, &A3);

	Sum = A1 + A2 + A3;

		if (Sum>=22)

		{

			printf("bust \n");

		}

		else if (Sum<22)

		{

			printf("win \n");

		}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297008687889783x):
#include <stdio.h>

int main()

{

	int A1, A2, A3;

	int Sum;

	scanf("%d %d %d", &A1, &A2, &A3);

	Sum = A1 + A2 + A3;

		if (Sum>=22)

		{

			printf("bust \n");

		}

		else if (Sum<22)

		{

			printf("win \n");

		}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.311417031641852x):
#include <stdio.h> 

int main() 

{

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	(A1+ A2+ A3 >= 22) ? printf("bust") : printf("win");

	return 0;

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.311567585945284x):
#include <stdio.h> 

int main() 

{

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	(A1+ A2+ A3 >= 22) ? printf("bust") : printf("win");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.372904586767893x):
#include <stdio.h> 

int main() 

{

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	(A1+ A2+ A3 >= 22) ? printf("bust") : printf("win");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297356267342256x):
#include <stdio.h> 

int main() 

{

	int A1, A2, A3;

	scanf("%d %d %d", &A1, &A2, &A3);

	(A1+ A2+ A3 >= 22) ? printf("bust") : printf("win");

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.31188529242679x):
#include <stdio.h>



int main ()

{	

	int r,s,t;

	

	scanf("%d %d %d", &r, &s, &t);

	

	if(r + s + t >= 22)

{

	printf("bust\n");

}	

	else if(r + s + t < 22)

{

	printf("win\n");

}

	return 0;

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.312035860003266x):
#include <stdio.h>



int main ()

{	

	int r,s,t;

	

	scanf("%d %d %d", &r, &s, &t);

	

	if(r + s + t >= 22)

{

	printf("bust\n");

}	

	else if(r + s + t < 22)

{

	printf("win\n");

}

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.3733782683681515x):
#include <stdio.h>



int main ()

{	

	int r,s,t;

	

	scanf("%d %d %d", &r, &s, &t);

	

	if(r + s + t >= 22)

{

	printf("bust\n");

}	

	else if(r + s + t < 22)

{

	printf("win\n");

}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297823288513641x):
#include <stdio.h>



int main ()

{	

	int r,s,t;

	

	scanf("%d %d %d", &r, &s, &t);

	

	if(r + s + t >= 22)

{

	printf("bust\n");

}	

	else if(r + s + t < 22)

{

	printf("win\n");

}

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.31188529242679x):
#include <stdio.h>

int main () 

{

int a, b, c;

scanf("%d %d %d", &a, &b, &c) ;

if ( (a+b+c)>=22) {

printf("bust\n") ;

}

else {

printf("win\n") ;

}

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.312035860003266x):
#include <stdio.h>

int main () 

{

int a, b, c;

scanf("%d %d %d", &a, &b, &c) ;

if ( (a+b+c)>=22) {

printf("bust\n") ;

}

else {

printf("win\n") ;

}

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.3733782683681515x):
#include <stdio.h>

int main () 

{

int a, b, c;

scanf("%d %d %d", &a, &b, &c) ;

if ( (a+b+c)>=22) {

printf("bust\n") ;

}

else {

printf("win\n") ;

}

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297823288513641x):
#include <stdio.h>

int main () 

{

int a, b, c;

scanf("%d %d %d", &a, &b, &c) ;

if ( (a+b+c)>=22) {

printf("bust\n") ;

}

else {

printf("win\n") ;

}

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.31188529242679x):
#include <stdio.h>



int main()

{

    int A1, A2, A3;

    scanf("%d %d %d", &A1, &A2, &A3);



    if(A1 + A2 +A3 >= 22){

            printf("bust\n");

    }

    else{

        printf("win\n");

    }



    return 0;

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.312035860003266x):
#include <stdio.h>



int main()

{

    int A1, A2, A3;

    scanf("%d %d %d", &A1, &A2, &A3);



    if(A1 + A2 +A3 >= 22){

            printf("bust\n");

    }

    else{

        printf("win\n");

    }



    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.3733782683681515x):
#include <stdio.h>



int main()

{

    int A1, A2, A3;

    scanf("%d %d %d", &A1, &A2, &A3);



    if(A1 + A2 +A3 >= 22){

            printf("bust\n");

    }

    else{

        printf("win\n");

    }



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297823288513641x):
#include <stdio.h>



int main()

{

    int A1, A2, A3;

    scanf("%d %d %d", &A1, &A2, &A3);



    if(A1 + A2 +A3 >= 22){

            printf("bust\n");

    }

    else{

        printf("win\n");

    }



    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    int a,b,c,n;

    cin>>a>>b>>c;

    n=a+b+c;

    if(n<22)

        cout<<"win"<<endl;

    else

        cout<<"bust"<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.311893676570683x):
#include <stdio.h>



int main()

{	

	int A1, A2, A3;

		scanf("%d %d %d", &A1, &A2, &A3);

	

	if (A1 + A2 + A3 < 22) {

		printf("win");

	}

	else {

		printf("bust");

	}



	return 0;

}
// Slower C++ solution:
#include<iostream>



using namespace std ;



int main()



{

    int a,b,c ;



    cin>>a>>b>>c ;



    if(a+b+c>=22)

    {

        cout<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.312044244384811x):
#include <stdio.h>



int main()

{	

	int A1, A2, A3;

		scanf("%d %d %d", &A1, &A2, &A3);

	

	if (A1 + A2 + A3 < 22) {

		printf("win");

	}

	else {

		printf("bust");

	}



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define int  long long

#define tc(t)  int t; cin>>t; while(t--)

#define f(n)    for(int i=1;i<=n;i++)

#define endl   "\n"















int32_t main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    int  a,b,c;



    cin>>a>>b>>c;

    if(a+b+c>=22) cout<<"bust"<<endl;

    else cout<<"win"<<endl;







    















}

// Faster C++ solution for the same problem (measured speedup: 5.373386749570986x):
#include <stdio.h>



int main()

{	

	int A1, A2, A3;

		scanf("%d %d %d", &A1, &A2, &A3);

	

	if (A1 + A2 + A3 < 22) {

		printf("win");

	}

	else {

		printf("bust");

	}



	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

 

#define ll long long

#define ull unsigned long long

 

using namespace std;

 

int main() {

	int A, B, C;

	cin >> A >> B >> C;

 

	if (A+B+C >= 22){

	cout << "bust" ;

 	} else {

	cout << "win" ;

 

 	}

 

 

 

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.297831650462427x):
#include <stdio.h>



int main()

{	

	int A1, A2, A3;

		scanf("%d %d %d", &A1, &A2, &A3);

	

	if (A1 + A2 + A3 < 22) {

		printf("win");

	}

	else {

		printf("bust");

	}



	return 0;

}