stablegradients/pie-gem5-pairs huggingface dataset:
// 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 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   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 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:
//

//  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.3225064618283255x):
#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;

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.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>

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.308988953891602x):
#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.311423560948857x):
#include<stdio.h>

int main (){

	int a,b,c,d;

	

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

	

	d=a+b+c;

	

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

int main (){

	int a,b,c,d;

	

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

	

	d=a+b+c;

	

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

int main (){

	int a,b,c,d;

	

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

	

	d=a+b+c;

	

	if(d<=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.311452499807256x):
#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;

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.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>

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.297963065489687x):
#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:
//

//  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.311452499807256x):
#include<stdio.h>



int main(){

	int x;

	int y;

	int z;

	

	scanf("%d %d %d",&x,&y,&z);

	int total = x+y+z;

	

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



int main(){

	int x;

	int y;

	int z;

	

	scanf("%d %d %d",&x,&y,&z);

	int total = x+y+z;

	

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



int main(){

	int x;

	int y;

	int z;

	

	scanf("%d %d %d",&x,&y,&z);

	int total = x+y+z;

	

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



int main()

{

	int A1, A2, A3, A4, check;

	

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

	A4 = A1+A2+A3;

	

	check=A4;

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



int main()

{

	int A1, A2, A3, A4, check;

	

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

	A4 = A1+A2+A3;

	

	check=A4;

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



int main()

{

	int A1, A2, A3, A4, check;

	

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

	A4 = A1+A2+A3;

	

	check=A4;

	if(check>=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 << "bust";

	}else {

	cout << "win";

	}

	

	return 0;

}

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



int main() {

  int a, b, c;

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



  if(a + b + c < 22) puts("win");

  else puts("bust");

  return 0;

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



using namespace std;



int main()

{ int i,x,u;







     cin>>i >>x>>u;

     if(i+x+u>=22)

        cout<<"bust";

     else

        cout<<"win";

    return 0;

}


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



int main() {

  int a, b, c;

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



  if(a + b + c < 22) puts("win");

  else puts("bust");

  return 0;

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

#include <iomanip>

#include <stdio.h>

#include <math.h>

#include <string>

#include <cstring>

#include <bits/stdc++.h>

#include <search.h>

#include <algorithm>

#include <vector>

#include <deque>

#include <set>

#include<stack>

#include <utility>

using namespace std;

int main()

{

int a1,a2,a3;

cin>>a1>>a2>>a3;

if(a1+a2+a3 >= 22) cout<<"bust";

else cout<<"win";

return 0;

}


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



int main() {

  int a, b, c;

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



  if(a + b + c < 22) puts("win");

  else puts("bust");

  return 0;

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

using namespace std;



int main() {

	int b,c,d;

	cin>>b>>c>>d;

	if(b+c+d>=22)

	cout<<"bust";

	else

	cout<<"win";

	return 0;

}

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



int main() {

  int a, b, c;

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



  if(a + b + c < 22) puts("win");

  else puts("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";

  }

  else{

    cout<<"win";

  }

}

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



int main() {

  int a, b, c;

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



  if(a + b + c < 22) puts("win");

  else puts("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 << "bust";

	}else {

	cout << "win";

	}

	

	return 0;

}

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

int main()

{

	int A1,A2,A3,hasil;

	scanf("%d",&A1);

	getchar();

	scanf("%d",&A2);

	getchar();

	scanf("%d",&A3);

	getchar();

	

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

		

		hasil = A1+A2+A3;

		

			printf("bust\n");

		

	}

	

	else

	{

		hasil = A1+A2+A3;

		

			printf("win\n");

	}

	

	

	

	return 0;

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



using namespace std;



int main()

{ int i,x,u;







     cin>>i >>x>>u;

     if(i+x+u>=22)

        cout<<"bust";

     else

        cout<<"win";

    return 0;

}


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

int main()

{

	int A1,A2,A3,hasil;

	scanf("%d",&A1);

	getchar();

	scanf("%d",&A2);

	getchar();

	scanf("%d",&A3);

	getchar();

	

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

		

		hasil = A1+A2+A3;

		

			printf("bust\n");

		

	}

	

	else

	{

		hasil = A1+A2+A3;

		

			printf("win\n");

	}

	

	

	

	return 0;

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

#include <iomanip>

#include <stdio.h>

#include <math.h>

#include <string>

#include <cstring>

#include <bits/stdc++.h>

#include <search.h>

#include <algorithm>

#include <vector>

#include <deque>

#include <set>

#include<stack>

#include <utility>

using namespace std;

int main()

{

int a1,a2,a3;

cin>>a1>>a2>>a3;

if(a1+a2+a3 >= 22) cout<<"bust";

else cout<<"win";

return 0;

}


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

int main()

{

	int A1,A2,A3,hasil;

	scanf("%d",&A1);

	getchar();

	scanf("%d",&A2);

	getchar();

	scanf("%d",&A3);

	getchar();

	

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

		

		hasil = A1+A2+A3;

		

			printf("bust\n");

		

	}

	

	else

	{

		hasil = A1+A2+A3;

		

			printf("win\n");

	}

	

	

	

	return 0;

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

using namespace std;



int main() {

	int b,c,d;

	cin>>b>>c>>d;

	if(b+c+d>=22)

	cout<<"bust";

	else

	cout<<"win";

	return 0;

}

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

int main()

{

	int A1,A2,A3,hasil;

	scanf("%d",&A1);

	getchar();

	scanf("%d",&A2);

	getchar();

	scanf("%d",&A3);

	getchar();

	

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

		

		hasil = A1+A2+A3;

		

			printf("bust\n");

		

	}

	

	else

	{

		hasil = A1+A2+A3;

		

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

  }

  else{

    cout<<"win";

  }

}

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

int main()

{

	int A1,A2,A3,hasil;

	scanf("%d",&A1);

	getchar();

	scanf("%d",&A2);

	getchar();

	scanf("%d",&A3);

	getchar();

	

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

		

		hasil = A1+A2+A3;

		

			printf("bust\n");

		

	}

	

	else

	{

		hasil = A1+A2+A3;

		

			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 << "bust";

	}else {

	cout << "win";

	}

	

	return 0;

}

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



int main()

{

	int x, y, z, hasil;

		scanf("%d %d %d", &x, &y, &z);

		hasil=x+y+z;

		if(hasil < 22){

			printf("win\n");

		}

		else if(hasil >= 22){

			printf("bust\n");

		}

	return 0;	

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



using namespace std;



int main()

{ int i,x,u;







     cin>>i >>x>>u;

     if(i+x+u>=22)

        cout<<"bust";

     else

        cout<<"win";

    return 0;

}


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



int main()

{

	int x, y, z, hasil;

		scanf("%d %d %d", &x, &y, &z);

		hasil=x+y+z;

		if(hasil < 22){

			printf("win\n");

		}

		else if(hasil >= 22){

			printf("bust\n");

		}

	return 0;	

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

#include <iomanip>

#include <stdio.h>

#include <math.h>

#include <string>

#include <cstring>

#include <bits/stdc++.h>

#include <search.h>

#include <algorithm>

#include <vector>

#include <deque>

#include <set>

#include<stack>

#include <utility>

using namespace std;

int main()

{

int a1,a2,a3;

cin>>a1>>a2>>a3;

if(a1+a2+a3 >= 22) cout<<"bust";

else cout<<"win";

return 0;

}


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



int main()

{

	int x, y, z, hasil;

		scanf("%d %d %d", &x, &y, &z);

		hasil=x+y+z;

		if(hasil < 22){

			printf("win\n");

		}

		else if(hasil >= 22){

			printf("bust\n");

		}

	return 0;	

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

using namespace std;



int main() {

	int b,c,d;

	cin>>b>>c>>d;

	if(b+c+d>=22)

	cout<<"bust";

	else

	cout<<"win";

	return 0;

}

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



int main()

{

	int x, y, z, hasil;

		scanf("%d %d %d", &x, &y, &z);

		hasil=x+y+z;

		if(hasil < 22){

			printf("win\n");

		}

		else if(hasil >= 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<<"bust";

  }

  else{

    cout<<"win";

  }

}

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



int main()

{

	int x, y, z, hasil;

		scanf("%d %d %d", &x, &y, &z);

		hasil=x+y+z;

		if(hasil < 22){

			printf("win\n");

		}

		else if(hasil >= 22){

			printf("bust\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 << "bust";

	}else {

	cout << "win";

	}

	

	return 0;

}

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



int main()

{

	int number1;

	scanf("%d", &number1);

	int number2;

	scanf("%d", &number2);

	int number3;

	scanf("%d", &number3);

	(number1 + number2 + number3 >= 22) ? puts("bust") : puts("win");

	

	return 0;

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



using namespace std;



int main()

{ int i,x,u;







     cin>>i >>x>>u;

     if(i+x+u>=22)

        cout<<"bust";

     else

        cout<<"win";

    return 0;

}


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



int main()

{

	int number1;

	scanf("%d", &number1);

	int number2;

	scanf("%d", &number2);

	int number3;

	scanf("%d", &number3);

	(number1 + number2 + number3 >= 22) ? puts("bust") : puts("win");

	

	return 0;

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

#include <iomanip>

#include <stdio.h>

#include <math.h>

#include <string>

#include <cstring>

#include <bits/stdc++.h>

#include <search.h>

#include <algorithm>

#include <vector>

#include <deque>

#include <set>

#include<stack>

#include <utility>

using namespace std;

int main()

{

int a1,a2,a3;

cin>>a1>>a2>>a3;

if(a1+a2+a3 >= 22) cout<<"bust";

else cout<<"win";

return 0;

}


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



int main()

{

	int number1;

	scanf("%d", &number1);

	int number2;

	scanf("%d", &number2);

	int number3;

	scanf("%d", &number3);

	(number1 + number2 + number3 >= 22) ? puts("bust") : puts("win");

	

	return 0;

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

using namespace std;



int main() {

	int b,c,d;

	cin>>b>>c>>d;

	if(b+c+d>=22)

	cout<<"bust";

	else

	cout<<"win";

	return 0;

}

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



int main()

{

	int number1;

	scanf("%d", &number1);

	int number2;

	scanf("%d", &number2);

	int number3;

	scanf("%d", &number3);

	(number1 + number2 + number3 >= 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";

  }

  else{

    cout<<"win";

  }

}

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



int main()

{

	int number1;

	scanf("%d", &number1);

	int number2;

	scanf("%d", &number2);

	int number3;

	scanf("%d", &number3);

	(number1 + number2 + number3 >= 22) ? puts("bust") : puts("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 << "bust";

	}else {

	cout << "win";

	}

	

	return 0;

}

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

int main(){

	int a,b,c;

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

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

		printf("bust");

	} else {

		printf("win");

	}

	return 0;

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



using namespace std;



int main()

{ int i,x,u;







     cin>>i >>x>>u;

     if(i+x+u>=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 a,b,c;

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

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

		printf("bust");

	} else {

		printf("win");

	}

	return 0;

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

#include <iomanip>

#include <stdio.h>

#include <math.h>

#include <string>

#include <cstring>

#include <bits/stdc++.h>

#include <search.h>

#include <algorithm>

#include <vector>

#include <deque>

#include <set>

#include<stack>

#include <utility>

using namespace std;

int main()

{

int a1,a2,a3;

cin>>a1>>a2>>a3;

if(a1+a2+a3 >= 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 a,b,c;

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

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

		printf("bust");

	} else {

		printf("win");

	}

	return 0;

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

using namespace std;



int main() {

	int b,c,d;

	cin>>b>>c>>d;

	if(b+c+d>=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 a,b,c;

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

	if(a+b+c >= 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<<"bust";

  }

  else{

    cout<<"win";

  }

}

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

int main(){

	int a,b,c;

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

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

		printf("bust");

	} else {

		printf("win");

	}

	return 0;

}