stablegradients/pie-gem5-pairs huggingface dataset:
// 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.307503847823417x):
#include <stdio.h>



int main()

{

  int A1;

  int A2; 

  int A3;

  int Total;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);

  Total = A1 + A2 + A3;

  if(Total>=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.307654291206042x):
#include <stdio.h>



int main()

{

  int A1;

  int A2; 

  int A3;

  int Total;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);

  Total = A1 + A2 + A3;

  if(Total>=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.368946102024239x):
#include <stdio.h>



int main()

{

  int A1;

  int A2; 

  int A3;

  int Total;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);

  Total = A1 + A2 + A3;

  if(Total>=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.293453442784824x):
#include <stdio.h>



int main()

{

  int A1;

  int A2; 

  int A3;

  int Total;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);

  Total = A1 + A2 + A3;

  if(Total>=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.322940155156879x):
#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<<"bust"<<endl ;



    }

    else

    {

        cout<<"win"<<endl ;

    }

}

// Faster C++ solution for the same problem (measured speedup: 5.323091036087994x):
#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<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.384561107583138x):
#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 <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.308848886017844x):
#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<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

// Faster C++ solution for the same problem (measured speedup: 5.244379766607357x):
#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>

#include<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

// Faster C++ solution for the same problem (measured speedup: 5.244379766607357x):
#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  s1,s2,s3;

cin>>s1>>s2>>s3;

if(s1+s2+s3>=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<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;

    }



    return 0;

}

// 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;



void fun(int A1, int A2, int A3)

{

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

      {

           cout<<"bust";

      }

      else

       cout<<"win";

}

int main()

{

     int A1,A2,A3;

     cin>>A1>>A2>>A3;

    fun(A1,A2,A3);

}

// Faster C++ solution for the same problem (measured speedup: 5.296908925511165x):
#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>

#include<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

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

int main(){

	int a, b, c;

	int total;

	int j;

	

	j = a, b, c;

	j<=13;

	j>=1;

	

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

	total = a + b +c;

	

	if(total>=22){

	printf("bust\n");

	}

	else{

	printf("win\n");

	}

	return 0;

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

using namespace std;

int main(){

int  s1,s2,s3;

cin>>s1>>s2>>s3;

if(s1+s2+s3>=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;

	int total;

	int j;

	

	j = a, b, c;

	j<=13;

	j>=1;

	

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

	total = a + b +c;

	

	if(total>=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;

    }



    return 0;

}

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

int main(){

	int a, b, c;

	int total;

	int j;

	

	j = a, b, c;

	j<=13;

	j>=1;

	

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

	total = a + b +c;

	

	if(total>=22){

	printf("bust\n");

	}

	else{

	printf("win\n");

	}

	return 0;

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

using namespace std;



void fun(int A1, int A2, int A3)

{

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

      {

           cout<<"bust";

      }

      else

       cout<<"win";

}

int main()

{

     int A1,A2,A3;

     cin>>A1>>A2>>A3;

    fun(A1,A2,A3);

}

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

int main(){

	int a, b, c;

	int total;

	int j;

	

	j = a, b, c;

	j<=13;

	j>=1;

	

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

	total = a + b +c;

	

	if(total>=22){

	printf("bust\n");

	}

	else{

	printf("win\n");

	}

	return 0;

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

#include<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

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



int main(){

	int A1, A2, A3;

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

	int sum = A1 + A2 + A3;

	(sum >= 22) ?puts("bust") : puts("win"); 

	return 0;

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

using namespace std;

int main(){

int  s1,s2,s3;

cin>>s1>>s2>>s3;

if(s1+s2+s3>=22){

  cout<<"bust"<<endl;

}

else{

   cout<<"win"<<endl;

}

}


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



int main(){

	int A1, A2, A3;

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

	int sum = A1 + A2 + A3;

	(sum >= 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 << "bust" << endl;

    }

    else

    {

        cout << "win" << endl;

    }



    return 0;

}

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



int main(){

	int A1, A2, A3;

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

	int sum = A1 + A2 + A3;

	(sum >= 22) ?puts("bust") : puts("win"); 

	return 0;

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

using namespace std;



void fun(int A1, int A2, int A3)

{

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

      {

           cout<<"bust";

      }

      else

       cout<<"win";

}

int main()

{

     int A1,A2,A3;

     cin>>A1>>A2>>A3;

    fun(A1,A2,A3);

}

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



int main(){

	int A1, A2, A3;

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

	int sum = A1 + A2 + A3;

	(sum >= 22) ?puts("bust") : puts("win"); 

	return 0;

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

#include<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

// Faster C++ solution for the same problem (measured speedup: 5.25529413979741x):
#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  s1,s2,s3;

cin>>s1>>s2>>s3;

if(s1+s2+s3>=22){

  cout<<"bust"<<endl;

}

else{

   cout<<"win"<<endl;

}

}


// Faster C++ solution for the same problem (measured speedup: 5.323091036087994x):
#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 << "bust" << endl;

    }

    else

    {

        cout << "win" << endl;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.323091036087994x):
#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 <bits/stdc++.h>

using namespace std;



void fun(int A1, int A2, int A3)

{

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

      {

           cout<<"bust";

      }

      else

       cout<<"win";

}

int main()

{

     int A1,A2,A3;

     cin>>A1>>A2>>A3;

    fun(A1,A2,A3);

}

// Faster C++ solution for the same problem (measured speedup: 5.307932620083184x):
#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<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

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

int main(){

  int A1,A2,A3;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);



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

    printf("bust");

  }else{

    printf("win");

  }

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

using namespace std;

int main(){

int  s1,s2,s3;

cin>>s1>>s2>>s3;

if(s1+s2+s3>=22){

  cout<<"bust"<<endl;

}

else{

   cout<<"win"<<endl;

}

}


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

int main(){

  int A1,A2,A3;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);



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

    printf("bust");

  }else{

    printf("win");

  }

}
// 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;

    }



    return 0;

}

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

int main(){

  int A1,A2,A3;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);



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

    printf("bust");

  }else{

    printf("win");

  }

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

using namespace std;



void fun(int A1, int A2, int A3)

{

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

      {

           cout<<"bust";

      }

      else

       cout<<"win";

}

int main()

{

     int A1,A2,A3;

     cin>>A1>>A2>>A3;

    fun(A1,A2,A3);

}

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

int main(){

  int A1,A2,A3;

  scanf("%d", &A1);

  scanf("%d", &A2);

  scanf("%d", &A3);



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

    printf("bust");

  }else{

    printf("win");

  }

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

#include<cstring>

using  namespace std;

int main()

{

	int a,b,c;

	while(scanf("%d%d%d",&a,&b,&c)!=EOF)

	{

		if(a+b+c>=22)

		printf("bust\n");

		else

		printf("win\n");

	}

 } 

// Faster C++ solution for the same problem (measured speedup: 5.25529413979741x):
#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  s1,s2,s3;

cin>>s1>>s2>>s3;

if(s1+s2+s3>=22){

  cout<<"bust"<<endl;

}

else{

   cout<<"win"<<endl;

}

}


// Faster C++ solution for the same problem (measured speedup: 5.323091036087994x):
#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 << "bust" << endl;

    }

    else

    {

        cout << "win" << endl;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.323091036087994x):
#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 <bits/stdc++.h>

using namespace std;



void fun(int A1, int A2, int A3)

{

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

      {

           cout<<"bust";

      }

      else

       cout<<"win";

}

int main()

{

     int A1,A2,A3;

     cin>>A1>>A2>>A3;

    fun(A1,A2,A3);

}

// Faster C++ solution for the same problem (measured speedup: 5.307932620083184x):
#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:
//

//  main.cpp

//  vjudge

//

//  Created by Sudipto Mondal on 7/9/20.

//  Copyright © 2020 Sudipto Mondal. All rights reserved.

//



#include <iostream>

using namespace std;

int main(int argc, const char * argv[]) {

    long long int a,b,c;

    cin>>a>>b>>c;

    

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

        cout<<"bust"<<endl;

    }else{

        cout<<"win"<<endl;

    }

    return 0;

}


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

int main(){

	int a;

	int b;

	int c;

	int sum;

	

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

	sum=a+b+c;

	if(sum<=21){

		printf("win");

	}

	else{

		printf("bust");

	}

	

	return 0;

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

using namespace std;

int main()

{

    int a,b,c;

    cin >> a >> b>> c;

    if(a+b+c<22)

        cout << "win\n";

    else

         cout << "bust\n";

}


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

int main(){

	int a;

	int b;

	int c;

	int sum;

	

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

	sum=a+b+c;

	if(sum<=21){

		printf("win");

	}

	else{

		printf("bust");

	}

	

	return 0;

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

using namespace std;

int main()

{ 

     int   a1,a2,a3,sum;

     

     cin>>a1;

     cin>>a2;

     cin>>a3;

     

     sum = a1 + a2 + a3;

     if(sum>=22)

     { 

          cout<<"bust";

     }

     else 

     {

         cout<<"win";

     }

      return 0;

} 


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

int main(){

	int a;

	int b;

	int c;

	int sum;

	

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

	sum=a+b+c;

	if(sum<=21){

		printf("win");

	}

	else{

		printf("bust");

	}

	

	return 0;

}
// Slower C++ solution:
//

//  main.cpp

//  vjudge

//

//  Created by Sudipto Mondal on 7/9/20.

//  Copyright © 2020 Sudipto Mondal. All rights reserved.

//



#include <iostream>

using namespace std;

int main(int argc, const char * argv[]) {

    long long int a,b,c;

    cin>>a>>b>>c;

    

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

        cout<<"bust"<<endl;

    }else{

        cout<<"win"<<endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.310984277174463x):
#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");

	}

	else {

		printf ("win");

	}

	return 0;

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

using namespace std;

int main()

{

    int a,b,c;

    cin >> a >> b>> c;

    if(a+b+c<22)

        cout << "win\n";

    else

         cout << "bust\n";

}


// Faster C++ solution for the same problem (measured speedup: 5.297289662883253x):
#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");

	}

	else {

		printf ("win");

	}

	return 0;

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

using namespace std;

int main()

{ 

     int   a1,a2,a3,sum;

     

     cin>>a1;

     cin>>a2;

     cin>>a3;

     

     sum = a1 + a2 + a3;

     if(sum>=22)

     { 

          cout<<"bust";

     }

     else 

     {

         cout<<"win";

     }

      return 0;

} 


// Faster C++ solution for the same problem (measured speedup: 5.297496031996484x):
#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");

	}

	else {

		printf ("win");

	}

	return 0;

}
// Slower C++ solution:
//

//  main.cpp

//  vjudge

//

//  Created by Sudipto Mondal on 7/9/20.

//  Copyright © 2020 Sudipto Mondal. All rights reserved.

//



#include <iostream>

using namespace std;

int main(int argc, const char * argv[]) {

    long long int a,b,c;

    cin>>a>>b>>c;

    

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

        cout<<"bust"<<endl;

    }else{

        cout<<"win"<<endl;

    }

    return 0;

}


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



int main (){

	

	int i,a,sum=0;

	

	for(i=1;i<=3;i++){

		scanf("%d", &a);

		sum=sum + a;

}

		

	if (sum>=22){

			printf("bust\n");

		}else {

			printf("win\n");

		}

	





return 0;

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

using namespace std;

int main()

{

    int a,b,c;

    cin >> a >> b>> c;

    if(a+b+c<22)

        cout << "win\n";

    else

         cout << "bust\n";

}


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



int main (){

	

	int i,a,sum=0;

	

	for(i=1;i<=3;i++){

		scanf("%d", &a);

		sum=sum + a;

}

		

	if (sum>=22){

			printf("bust\n");

		}else {

			printf("win\n");

		}

	





return 0;

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

using namespace std;

int main()

{ 

     int   a1,a2,a3,sum;

     

     cin>>a1;

     cin>>a2;

     cin>>a3;

     

     sum = a1 + a2 + a3;

     if(sum>=22)

     { 

          cout<<"bust";

     }

     else 

     {

         cout<<"win";

     }

      return 0;

} 


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



int main (){

	

	int i,a,sum=0;

	

	for(i=1;i<=3;i++){

		scanf("%d", &a);

		sum=sum + a;

}

		

	if (sum>=22){

			printf("bust\n");

		}else {

			printf("win\n");

		}

	





return 0;

}
// Slower C++ solution:
//

//  main.cpp

//  vjudge

//

//  Created by Sudipto Mondal on 7/9/20.

//  Copyright © 2020 Sudipto Mondal. All rights reserved.

//



#include <iostream>

using namespace std;

int main(int argc, const char * argv[]) {

    long long int a,b,c;

    cin>>a>>b>>c;

    

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

        cout<<"bust"<<endl;

    }else{

        cout<<"win"<<endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.311460883268041x):
#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;

}