/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long arr[9];
    for(int i=0; i<4; i++)
    {
        cin>>arr[i];
    }
    sort(arr,arr+4);
    cout<<arr[3]-arr[0]<<" "<<arr[3]-arr[1]<<" "<<arr[3]-arr[2]<<endl;
    return 0;
}
*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define pi 3.1416
#define ll long long
using namespace std;
int main()
{
    int a;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        int b;
        cin>>b;
        double result = pi*(b*b);
        cout<<fixed<<setprecision(3)<<result<<endl;
    }
    return 0;
}*/


/*#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
double PI=3.141593;
int main()
{


    double fib[50];
    fib[0]=0.0,fib[1]=1.0;
    for(int i=2;i<=50;i++)
    {
        fib[i]=fib[i-1]+fib[i-2];
    }
    int t;
    cin>>t;
    while(t--)
    {
        double n,ans=0.0;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            ans+=(fib[i]*fib[i]) - ((PI*fib[i]*fib[i])/4.0);
        }
        cout<<fixed<<setprecision(2)<<ans<<endl;
    }

    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    cout<<"
SAICE Intra university programming contest"<<endl;
    cout<<"Organized By"<<endl;
    cout<<"Programming club,SAICE"<<endl;
    cout<<"Department of information and communication Engineering"<<endl;
    cout<<"Islamic university,kushtia"<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    /*int a,b,c,d,e,f;
    a = (5-2)*180;
    b = a/5;
    c = 180 - b;
    d = c + c;
    e = 180 - d;
    f = e+e+e+e+e;
    cout<<f<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        int b,c;
        char d;
        cin>>b>>d>>c;
        if(d=='+')
            {
                cout<<"Case "<<i<<": "<<b+c<<endl;
        }
        else if(d=='-')
            {
                cout<<"Case "<<i<<": "<<b-c<<endl;
        }
        else if(d=='*')
            {
                cout<<"Case "<<i<<": "<<b*c<<endl;
        }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll dp[100],z;
    memset (dp,0,sizeof(dp));
    dp[0]=-1;
    dp[1]=1;
    dp[2]=2;
    for(int i=1; i<=90/2; i++)
    {
        dp[2*i]= dp[i]*dp[i]+1;
        dp[(2*i)+1]= dp[i] * dp[i+1] +2;
    }

    int a;
    cin>>a;
    for(int i =1; i<=a; i++)
    {
        cin>>z;
        cout<<"Case "<<i<<": ";
        for(int i=0; i<=100; i++)
        {
            if(z==dp[i])
            {
                cout<<i<<endl;
                break;
            }
        }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        int b;
        cin>>b;
        cout<<((b-3)/3)+2<<endl;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int fib(int a)
{
    if(a<=1)
    {
        return a;
    }
    return fib(a-1) + fib(a-2);
}
int main()
{
    int a;
    cin>>a;
    cout<<fib(a);
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a;
    cin>>a;
    int pt = pow(2, a-1);
    cout<<pt;
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
long long arr[100];
int a,i,len,d;
int main()
{
    cin>>a;
    for(i=0; i<a; i++)
    {
        cin>>arr[i];
    }
    sort(arr,arr+a);
    len = unique(arr,arr+a) -arr;
    cout<<len<<endl;
   if(len>3)
    {
        cout<<"-1"<<endl;
    }
    else if(len == 1)
    {
        cout<<"0"<<endl;
    }
    else if(len == 2)
    {
        d = arr[1]-arr[0];
        if(d%2==1)
        {
            cout<<d<<endl;
        }
        else
        {
            cout<<d/2<<endl;
        }
    }
    else
    {
        if(arr[1]-arr[0] != arr[2]-arr[1])
        {
            cout<<"-1"<<endl;
        }
        else
        {
            cout<<(arr[2]-arr[1])<<endl;
        }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long a,t,n,sum=0;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        cin>>n;
        for(int j=1; j<=n; j++)
        {
            sum += (j*j);
        }
        cout<<sum<<endl;
        sum=0;
        t = (n * (n+1) * (2*n+1)) /6;
        cout<<t<<endl;
    }
    return 0;
}*/
/*#include<bits/stdc++.h>
#include<iomanip>
#define pi 3.14159265358979323846
using namespace std;
int main()
{
    double a,r,c,b,d,t;
    cin>>t;
    for(int i=1; i<=t; i++)
    {
        cin>>r>>c;
    a = pi * (r * r) ;
    b = c/360;
    d = a * b;
    cout<<fixed<<setprecision(9)<<d<<endl;
    }
    return 0;
}*/
/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    int a,i,x;
    cin>>a;
    for(i=1;i<=a;i++)
    {
        cin>>s;
         x=s.length();
        if(x<=10)
        {
            cout<<s<<endl;
        }
        else
        {
            cout<<s[0]<<x-2<<s[x-1]<<endl;
        }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
   int a,i,sum=0,dum=0;
   cin>>a;

   for(i=1; i<=a; i+=2)
   {
        sum+=i;
   }
   for(int j=2; j<=a; j+=2)
   {
       dum-=j;
   }
   int r = sum+dum;
   cout<<r;

    return 0;
}*/


/*#include<bits/stdc++.h>
using namespace std;
int main()
{

    int row,a,b,column;
    cin>>row;
    for(a=row; a>=1; a--)
    {
        for(b=1; b<=a; b++)
        {
            cout<<"* ";
        }
        cout<<endl;
    }
    return 0;
}*/

//lightoj 1001
/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c,d,e;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        cin>>b;

        c = b/2;
        d = b % 2 + c;

        cout<<c<<" "<<d<<endl;
    }

    return 0;
}*/

//lightoj 1006
/*#include <bits/stdc++.h>
using namespace std;
long long t;
long long a;
long long b;
long long c;
long long d;
long long e;
long long f;
long long n;
long long x[10005];

int fn( int n )
{
	for (int i = 0; i <= n; i++)
        {

    	if( i == 0 )
            {
			x[i] = a;
			continue;
		}
	    if( i == 1 )
	    {
			x[i] = b;
			continue;
		}
    	if( i == 2 )
    	{
			x[i] = c;
			continue;
		}
	    if( i == 3 )
	    {
			x[i] = d;
			continue;
		}
    	if( i == 4 )
    	{
			x[i] = e;
			continue;
		}
	    if( i == 5 )
	    {
			x[i] = f;
			continue;
		}
    	x[i] = x[i-1] + x[i-2] + x[i-3] + x[i-4] + x[i-5] + x[i-6];
		x[i] = x[i] % 10000007;

	}

	return x[n];
}

int main()
{
	long long ans;
	cin >> t;
	for (long long i = 1; i <= t; i++) {
		cin >> a;
		cin >> b;
		cin >> c;
		cin >> d;
		cin >> e;
		cin >> f;
		cin >> n;

		ans = fn(n);
		ans = ans % 10000007;

		cout << "Case "<< i <<": "<< ans << endl;
	}
}*/

/*#include<bits/stdc++.h>
#include<algorithm>
#include<iomanip>
using namespace std;

int main()
{
    int a,b,c,d,e;
    cin>>a;
    b = sqrt(a);
    c = sqrt(b);
    d = sqrt(c);
    e = sqrt(d);
    cout<<e<<setprecision<<fixed(10);
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
  long long a,b,c,d;
  cin>>a;
  for(int i=1; i<=a; i++)
  {
      cin>>b>>c>>d;
      cout<<max(b-d,b-c)+1<<endl;
  }
  return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    if(a<b)
    {
        cout<<"0"<<endl;
    }
    else
    {
        cout<<"1"<<endl;
    }
    return 0;
}*/
/*#include<bits/stdc++.h>
using namespace std;
int main()
{
   long long s,x,d,count=0;
   cin>>s>>x;
   for(int i=x; i<=s; i++)
   {
       d = s/x;
       count++;
       if(d==0)
       {
           break;
       }
       else
       {
           d = d + 0;
       }
   }
   cout<<count<<endl;
   return 0;
}*/

/*#include <bits/stdc++.h>

using namespace std;

int main()
{
    int x;

    cin >> x;
    if(x%4 == 1)
        cout<<"0 A"<<endl;
    else if(x%4==3)
        cout<<"2 A"<<endl;
    else if(x%4==2)
        cout<<"1 B"<<endl;
    else if(x%4==0)
        cout<<"1 A"<<endl;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        cin>>b>>c;
        cout<<c*2<<endl;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
    {
        int a;
        cin>>a;
        long long b,c,d;
        for(int i=1; i<=a; i++)
        {
           cin>>b>>c>>d;
           cout<<(b+c+d)/2<<endl;
        }
        return 0;
    }
*/

/*#include<bits/stdc++.h> // Educational Codeforces Round 71 (Rated for Div. 2)
using namespace std;     // A. There Are Two Types Of Burgers

int main()
{
    long long test, bun, beef_pat, chick_cut, ham_tk, chick_tk, total_burger, max_profit;
    cin>>test;

   for(int i=1; i<=test; i++)
        {
          cin>>bun>>beef_pat>>chick_cut>>ham_tk>>chick_tk;
          max_profit=0;
          total_burger = bun/2;
          if(ham_tk>chick_tk)
            {
            for(int i=1;  i<=beef_pat; i++)
            {
                if(total_burger>0)
                {
                    max_profit+=ham_tk;
                }
                else
                {
                  break;
                }
                total_burger--;
            }
            for(int i=1; i<=chick_cut; i++)
            {
                if(total_burger>0)
                {
                    max_profit+=chick_tk;
                }
                else
                {
                    break;
                }
                total_burger--;
            }
        }
        else
            {
            for(int i=1; i<=chick_cut; i++)
            {
                if(total_burger>0)
                {
                    max_profit+=chick_tk;
                }
                else
                {
                    break;
                }
                total_burger--;
            }
            for(int i=1; i<=beef_pat; i++)
            {
                if(total_burger>0)
                {
                    max_profit+=ham_tk;
                }
                else
                {
                    break;
                }
                total_burger--;
            }
        }
        cout<<max_profit<<endl;
    }
    return 0;
}*/

/*#include<bits/stdc++.h> // Codeforces Round #579 (Div. 3)
using namespace std;     // A. Circle of Students
int main()
{
    long long test, i, input, arr[200];
    cin>>test;
    for(int j=0; j<test; j++)
    {
        cin>>input;
        for(i=0; i<input; i++)
        {
            cin>>arr[i];
        }
        i=1;
        while((abs(arr[i]-arr[i-1]) ==1 || abs(arr[i]-arr[i-1])== input - 1) && i!=input)
              {
                  i++;
              }
              if(i==input)
                {
                    cout<<"YES"<<endl;
                }
                else
                {
                    cout<<"NO"<<endl;
                }
    }
    return 0;
}*/


/*#include<bits/stdc++.h> // AIUB Team Selection 1 for ICPC
using namespace std;     // Seven Segment Generator
int main()
{

    long long test, a,x,y;
    int c=2,d=3,e=4,f=5,g=6,h=7;
    cin>>test;
    for(int i=1; i<=test; i++)
    {
        cin>>a;

            if(a%2==0)
            {
                x = a/2;
            for(int i=1; i<=x; i++)
            {
                cout<<"1";
            }
            cout<<endl;
            }
            else
            {
                x = a/2;
                cout<<"7";
                for(int j=1; j<=x-1; j++)
                {
                    cout<<"1";
                }
                cout<<endl;
            }
        }


    return 0;
}*/


/*#include<bits/stdc++.h> //Codeforces Round #578 (Div. 2)
using namespace std;     // 1200A - Hotelier
int main()
{
    int x,a[10],i,j;
    char s;
    cin>>x;
    memset(a,0,sizeof(a));
        for(i=0; i<x; i++)
      {
        cin>>s;
        if(s=='L')
        {
            for(j=0; j<10; j++)
            {
                if(a[j]==0)
                {
                    a[j]=1;
                    break;
                }
            }
        }
        else if(s=='R')
        {
            for(j=9; j>=0; j--)
            {
                if(a[j]==0)
                {
                    a[j]=1;
                    break;
                }
            }
        }
        else
        {
            a[s-48]=0;
        }
    }
        for(i=0; i<10; i++)
    {
        cout<<a[i];
    }
    cout<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h> //Codeforces Round #578 (Div. 2)
using namespace std;     // 1200A - Hotelier
int main()
{
    int x, a[10]={0,0,0,0,0,0,0,0,0,0}, i, j;
    int l=0,r=9;
    string s;
    cin>>x;
    cin>>s;
    for(i=l; i<x; i++)
    {
        if(s[i]=='L')
        {
            for(j=0; j<10; j++)
            {
            if(a[j]==0)
            {
                a[j]=1;
                break;
            }
            }

        }
        else if(s[i]=='R')
        {
            for(j=r; j>=0; j--)
            {
                if(a[j]==0)
                {
                    a[j]=1;
                    break;
                }
            }
        }
        else
        {
            a[s[i]-'0']=0;
        }
    }
    for(i=0; i<10; i++)
    {
        cout<<a[i];
    }
    return 0;
}*/

/*#include<bits/stdc++.h> // Codeforces Round #580 (Div. 2)
using namespace std;     // A. Choose Two Numbers
int main()
{
   int x,y,i,j;
   cin>>x;
   int a[x];
   for(i=0; i<x; i++)
   {
       cin>>a[i];
   }
   cin>>y;
   int b[y];
   for(j=0; j<y; j++)
   {
       cin>>b[j];
   }
   sort(a,a+x);
   sort(b,b+y);
   for(i=0; i<x; i++)
   {
       for(j=0; j<y; j++)
       {
           int sum = a[i]+b[j];
           int c = binary_search(a,a+x,sum);
           int d = binary_search(b,b+y,sum);
           if
            (c==0 && d==0)
           {
               cout<<a[i]<<" "<<b[j];
               return 0;
           }
       }
   }

}*/

/*#include<bits/stdc++.h> // Codeforces Round #580 (Div. 2)
using namespace std;     // A. Choose Two Numbers
int main()
{
    int x,y,i,j;
    cin>>x;
    int a[x];
    for(i=0; i<x; i++)
    {
        cin>>a[i];
    }
    cin>>y;
    int b[y];
    for(j=0; j<y; j++)
    {
        cin>>b[j];
    }
    sort(a,a+x);
    sort(b,b+y);
    cout<<a[x-1]<<" "<<b[y-1];
    return 0;
}*/

/*#include<bits/stdc++.h>  // Codeforces Round #580 (Div. 2)
using namespace std;      // A. Choose Two Numbers
int main()
{
    int x,y,A=0,B=0,a,b;
    cin>>x;
    for(int i=0; i<x; i++)
    {
        cin>>a;
        A = max(A,a);
    }
    cin>>y;
    for(int i=0; i<y; i++)
    {
        cin>>b;
        B = max(B,b);
    }
    cout<<A<<" "<<B;
    return 0;
}*/

/*#include<bits/stdc++.h> // Team Formation Collaborative Contest - 2 [AIUB, IST, SUB, ULAB]
using namespace std;     // A. The Ashes
int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  int AUS_1,ENG_1,AUS_2,ENG_2,T;
  cin>>T;
  for(int i=1; i<=T; i++)
  {
      int aus=0,eng=0;
      cin>>AUS_1>>ENG_1>>AUS_2>>ENG_2;
      aus = AUS_1+AUS_2;
      eng = ENG_1+ENG_2;
      if(aus>eng) cout<<"AUSTRALIA"<<endl;
      else if(aus<eng) cout<<"ENGLAND"<<endl;
      else cout<<"TIE"<<endl;
  }
    return 0;
}*/



/*#include<bits/stdc++.h> // Team Formation Collaborative Contest - 2 [AIUB, IST, SUB, ULAB]
using namespace std;   // F. Skipping Ropes
int main()
{
    //freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
    int test,i,j,k;
    long long n,x;
    cin>>test;
    for(int i=1; i<=test; i++)
    {
        long long sum=0,count=0;
        cin>>n>>x;
        for(j=0; j<n; j++)
        {
            if(count==n)
            {
                break;
            }
            else
            {
                sum = sum +1;
                count++;
            }
            for(k=0;k<x; k++)
            {
                if(count==n)
                {
                    break;
                }
                else
                {
                    sum = sum + 2;
                    count++;
                }
            }
        }
       cout<<sum<<endl;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>  // Codeforces Round #582 (Div. 3)
using namespace std;      //  A. Chips Moving
int main()
{
    int a;
    int x,i,j,sum=0,dum=0;
    cin>>a;
    int b[a];
    for(i=0; i<a; i++)
    {
        cin>>b[i];
    }
    for(i=0; i<a; i++)
    {
        if(b[i]%2==0)
        {
            sum++;
        }
        else
        {
            dum++;
        }
    }
    cout<<min(sum,dum)<<endl;

    return 0;
}*/

/*#include<bits/stdc++.h>  // AtCoder Beginner Contest 139
using namespace std;    // A - Tenki
int main ()
{
	string a;
	cin>>a;
	string b;
	cin>>b;
	int i= 0, j = 0, sum = 0;
	for(i=0; i<3; i++)
	{
		if (a[i]==b[j])
	{
		sum++;
		j++;
	}
	else
	{
	    j++;
	}
	}
	cout<<sum<<endl;
	return 0;

}*/

/*#include<bits/stdc++.h> // Codeforces Round #582 (Div. 3)
using namespace std;   // B. Bad Prices
int main()
{
    int t,x,i,j;
    cin>>t;
    while(t--)
    {
        int sum=0;
        cin>>x;
        int a[x];
        for(i=0; i<x; i++)
        {
            cin>>a[i];
        }
        int min_value = 1e9;
        for(j=x-1; j>=0; j--)
        {
            if(a[j]>min_value)
            {
                sum++;
            }
            else
            {
               min_value = a[j];
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}*/

/*#include <bits/stdc++.h>
using namespace std;
int main()
{
    int test,a[3],b[3];
    cin>>test;
    for(int z=1; z<=test; z++)
    {

    for(int i=0; i<3; i++)
    {
        cin>>a[i];
    }
    for(int j=0; j<3; j++)
    {
        cin>>b[j];
    }
    while(1)
    {
        for(int f=0; f<2; f++)
        {
            if(a[f]>a[f])
        {
            swap(a[f],a[f]);
            swap(b[f],b[f]);
            if(a[0]<a[1] && a[1]<a[2])
            {
                break;
            }
        }
        }
    }

    if(a[0]==a[1] && a[1]==a[2])
    {
        if(b[0]==b[1] && b[1]==b[2])
        {
            cout<<"FAIR"<<endl;
        }
        else
        {
           cout<<"NOT FAIR"<<endl;
        }
    }
    else if(a[0]==a[1] && a[1]!=a[2])
    {
        if(b[0]==b[1] && b[1] != b[2])
        {
            cout<<"FAIR"<<endl;
        }
        else
        {
            cout<<"NOT FAIR"<<endl;
        }
    }
    else if(a[0] != a[1] && a[1] == a[2])
    {
        if(b[0]!=b[1] && b[1] == b[2])
        {
            cout<<"FAIR"<<endl;
        }
        else
        {
            cout<<"NOT FAIR"<<endl;
        }
    }
    //else if(a[0]<a[1] && a[1]<a[2])
    //{
    else
    {
        if(b[0]<b[1] && b[1]<b[2])
    {
        cout<<"FAIR"<<endl;
    }
    else
    {
        cout<<"NOT FAIR"<<endl;
    }
    }
    //}
}
return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a = 100;
    int b =a-1;
    int c = b*3;
    int d = c+12;
    int e = d/13;
    int f = e+5;
    int g = f-a;
    int h = g*2;
    int i = h+6;
    int j = i/2;
    int k = j - g;
    cout<<k<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h> // AtCoder Beginner Contest 141
#include<string>         // A.	Weather Prediction
using namespace std;
int main()

{
    string s;
    cin>>s;
    if(s=="Sunny") cout<<"Cloudy"<<endl;
    else if(s=="Cloudy") cout<<"Rainy"<<endl;
    else cout<<"Sunny"<<endl;
    return 0;
*/

/*#include<bits/stdc++.h> // AtCoder Beginner Contest 141
using namespace std;     // B.	Tap Dance
int main()
{
    int x,y;
    string s;
    cin>>s;
    int a = s.size();

    for(int i=0; i<a; i+=2)
    {
        if(s[i]=='R' || s[i]=='U' || s[i]=='D')
        {
            x = 1;
        }
        else
        {
            x=0;
            break;
        }
    }

    for(int i=1; i<a; i+=2)
    {
        if(s[i]=='L' || s[i]=='U' || s[i]=='D')
        {
            y = 1;
        }
        else
        {
            y=0;
            break;
        }

    }
    if(x==1 && y==1)
    {
        cout<<"Yes"<<endl;
    }
    else
    {
        cout<<"No"<<endl;
    }

    return 0;

}*/

/*#include<bits/stdc++.h> // AtCoder Beginner Contest 141
using namespace std;     // C.	Attack Survival
int main()
{
    int x,y,z,m;
    cin>>x>>y>>z;
    int a[x];
    for(int i=0; i<x; i++)
    {
        a[i]=y;
    }
    for(int j=0; j<z; j++)
    {
        cin>>m;
        a[m-1]++;
    }
    for(int i=0; i<x; i++)
    {
        if(a[i]-z>0) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}*/


/*#include<iostream>  // E
using namespace std;
int main()
{
    int t,a,b,x,sum=0;
    cin>>t;
    for(int i=1; i<=t; i++)
    {
        cin>>a>>b;
        for(int j=1; j<=a; j++)
        {
            cin>>x;
            sum+=x;
        }
        int y = ((a+1)*b)-sum;
        cout<<"Case "<<i<<": "<<y<<endl;;
        sum=0;
    }
    return 0;
}*/

/*#include<iostream>  //  D
using namespace std;
int main()
{
    int t,x,y;
    cin>>t;
    for(int i=1; i<=t; i++)
    {
        cin>>x>>y;
        if(x>y || x==y)
        {cout<<"MMM BRAINS"<<endl;}
        else {cout<<"NO BRAINS"<<endl;}
    }
    return 0;
}*/

/*#include<iostream> //C
using namespace std;
int main()

{
    double a[12],sum=0,b;
    for(int i=1; i<=12; i++)
    {
        cin>>a[i];
        sum=sum+a[i];
    }
     b = sum/12;
    cout<<"$"<<b<<endl;
    return 0;
}*/

/*#include<iostream>  // B
using namespace std;
int main()
{
    int a,x,y;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        cin>>x>>y;
        if(x<y)
        {
            cout<<"<"<<endl;
        }
        else if(x>y)
        {
            cout<<">"<<endl;
        }
        else if(x=y)
        {
            cout<<"="<<endl;
        }
    }
    return 0;
}*/

/*#include<iostream> // A
using namespace std;
int main()
{
    cout<<"Hello World"<<endl;
    return 0;
}*/

/*#include<iostream> // F
using namespace std;
int main()
{
    int a;
    cin>>a;
    if(a<=2 || a%2 != 0) cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>  // G
#include<iomanip>
using namespace std;
int main()
{
    double t,a[3],b;
    int i,j;
    cin>>t;
    for(i=1; i<=t; i++)
    {
          for( j=0; j<3; j++)
          {
              cin>>a[j];
          }
          sort(a,a+3);
          if(a[0]<10 && a[1]<10)
          {
              cout<<"Failed"<<endl;
          }
          else
          {
              b = (a[1]+a[2])/2;
              cout<<fixed<<setprecision(2)<<b<<endl;
          }
          b=0;
    }
    return 0;
}*/

/*#include<bits/stdc++.h> // H
using namespace std;
int main()
{
    int a,b;
    cin>>a;

        for(int i=0; i<a; i++)
        {
            cin>>b;
            b=((((((b*567)/9)+7492)*235)/47)-498);
            b= (b/10)%10;
            cout<<abs(b)<<endl;
        }
    return 0;
}*/

/*#include<bits/stdc++.h>  // J
using namespace std;
int main()
{
    int a;
    cin>>a;
    if(a>=1 && a<=4) cout<<"few"<<endl;
    else if(a>=5 && a<=9) cout<<"several"<<endl;
    else if(a>=10 && a<=19) cout<<"pack"<<endl;
    else if(a>=20 && a<=49) cout<<"lots"<<endl;
    else if(a>=50 && a<=99) cout<<"horde"<<endl;
    else if(a>=100 && a<=249) cout<<"throng"<<endl;
    else if(a>=250 && a<=499) cout<<"swarm"<<endl;
    else if(a>=500 && a<=999) cout<<"zounds"<<endl;
    else if(a>=1000) cout<<"legion"<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>  // I
using namespace std;
int main()
{
    int t,a[3],i,j;
    cin>>t;
    for(i=1; i<=t; i++)
    {
            for(j=0; j<3; j++)
            {
                cin>>a[j];
            }
        sort(a,a+3);
        cout<<"Case "<<i<<": "<<a[1]<<endl;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()

{
    int a;
    double sum=0;
    cin>>a;
    for(int i=1; i<=a; i++)
    {
        if(i%2==1)
        {
            sum++;
        }
        else
        {
            sum = sum + 0;
        }
    }
    cout<<fixed<<setprecision(10)<<sum/a;

    return 0;
}*/
/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a,n,k,sum=0;
    cin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        cin>>a;
        if(a>=k)
        {
            sum++;
        }
    }
    cout<<sum<<endl;

    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long j,t,n,m,k,sum=0;
    cin>>t;

    while(t--)
    {
        cin>>n>>m;
        long long arr[m];
        for(int j=0; j<m; j++)
      {
        cin>>arr[j];
      }
        for(int i=0; i<m; i++)
      {
        if(arr[i]<arr[i+1] || arr[i]==arr[i+1])
        {
            sum++;
        }
        else
        {
            int z = arr[i]-arr[i+1];
            if(z==1)
            {
                sum++;
            }
        }

    }
        if(sum==m)
      {
          cout<<"YES"<<endl;
      }
     else
     {
        cout<<"NO"<<endl;
     }
    }

    return 0;
}*/

/*#include<iostream>
#include<sstream>
#include<string>
using namespace std;
int main()
{

    long long int a,b;
    int i,sum=0;
    cin>>a>>b;
    int z = b-a;
    int p = sizeof(a);
    int s = sizeof(b);
    for(i=1; i<=z; i++)
    {
    ostringstream str1;
    //ostringstream str2;
    str1<<a;
    //str2<<b;
    string a1 = str1.str();
    //string b1 = str2.str();
        for(int j=0; j<s; j++)
        {
            if(a1[j]!=a1[j+1])
            {
                sum = sum+1;
            }
        }
        if(sum==p || sum==s)
        {
            cout<<a1<<endl;
            return 0;
        }
        else
        {
            a = a + 1;
        }
    cout<<"-1"<<endl;

    return 0;
}
}*/

/*#include<iostream>
#include<sstream>
#include<string>
using namespace std;
int main()
{
    long long a,b,c,sum=0,s1;
    cin>>a>>b;
    c = b-a;
    ostringstream str1;
    str1<<a;
    string s = str1.str();
    for(int i=a; i<=b; i++)
    {
        s1 = sizeof(i);
        sort(s,s+s1);
        for(int j=0; j<(s1-1); j++)
        {
            for(int k=1; k<s1; k++)
            {
                if(s[j]!=s[k])
                {
                    sum=sum+1;
                }
                else
                {
                    sum=0;
                    i++;
                }
            }
        }
        if(sum==(s1-1)) cout<<i;
        break;
    }
    cout<<"-1"<<endl;
  return 0;
}*/

/*#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	long long a,b,j,ans;
	cin>>b;

	while(b--)
	{
		cin>>a;
	    long long arr[a];
		for(int i = 0; i<a; i++)
            {
                cin>>arr[i];
            }

       sort(arr,arr+a, greater<int>());
           ans = 0;
   	      for(j=0; j<a; j++)
	      {
		    if(arr[j]==2048) {ans=2048;}

		    else
            {
                if(arr[j]<2048 && ans !=2048)
                {
                    ans+=arr[j];

		        }
	        }
        }
        if(ans==2048) cout<<"YES"<<endl;
	      else cout<<"NO"<<endl;
   }
return 0;
}*/

/*#include<bits/stdc++.h>  // A. Pens and Pencils
using namespace std;  // https://codeforces.com/contest/1244/problem/A
int main()
{
    double a,b,c,d,k,t;
    double x,y;
    cin>>t;
    while(t--)
    {
        x = 0,y=0;
        cin>>a>>b>>c>>d>>k;
        x = ceil(a/c);
        y = ceil(b/d);
        if(x+y>k) cout<<"-1"<<'\n';
        else cout<<x<<" "<<y<<'\n';
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    int a,b,c,count=0,sum=0;
    cin>>a>>b;
    c = 2*b;
    int arr[c];
    for(int i=1; i<=c; i++)
    {
        cin>>arr[i];
    }
    for(int i=1; i<=c; i+=2)
    {
        if(a>arr[i]) a+=arr[i+1];
    }
    for(int i=1; i<=c; i+=2)
    {
        if(a>arr[i]) count++;
    }

    /*for(int i=1; i<=c; i++)
    {
        if (a>arr[i])
        {
            count++;
        }

    }
    if(count==b) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
#define s string
#define d double
using namespace std;
int main()
{
  ios_base::sync_with_stdio (false);
  cin.tie (NULL);
  int a, b;
  cin>>a>>b;
  if(a>b)
  {
      int c = 2*b;
      int e = a-c;
      if(e<0) cout<<"0"<<endl;
      else cout<<e<<endl;
  }
  else cout<<"0"<<endl;
  return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
#define s string
#define d double
using namespace std;
int main()
{
  ios_base::sync_with_stdio (false);
  cin.tie (NULL);
  int x;
  cin>>x;
  int a[x],sum=0;
  for(int i=1; i<=x; i++)
  {
      cin>>a[i];
  }
  sort(a,a+x);
  if(a[1]==0)
  {
  for(int i=2; i<x; i++)
  {
      for(int j=i+1; j<=x; j++)
      {
          sum*=a[j];
      }
  }
    cout<<sum<<endl;
  }
  else
  {
      for(int i=1; i<x; i++)
    {
      f/*or(int j=i+1; j<=x; j++)
      {
          sum = sum + (a[i] * a[j]);
      }
  }
  cout<<sum<<endl;
  }
  return 0;
}*/

/*#include<bits/stdc++.h>
#include<string>
#define ll long long
#define s string
#define d double
using namespace std;
int main()
{
  ios_base::sync_with_stdio (false);
  cin.tie (NULL);
   int t,count=0;
   cin>>t;
  char s[t];
  for(int i=0; i<t; i++)
  {
      cin>>s[i];
  }
  for(int i=0; i<t; i++)
  {
      if(s[i]==s[i+1]) s[i]='1';
  }
  for(int i=0; i<t; i++)
  {
      if(s[i]>='a' && s[i]<='z') count++;
  }
cout<<count<<endl;
  return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long a,b;
    cin>>a;
    b = a%10;
    if(b<5) cout<<a-b;
    else if(b>5) cout<<(10-b)+a;
    else if(b==5) cout<<a+b;
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t,a,b,count=0;
    cin>>t;
    while(t--)
    {
          ios_base::sync_with_stdio (false);
  cin.tie (NULL);

        cin>>a;
        long long arr[a];
        for(int i=1; i<=a; i++) cin>>arr[i];

        cin>>b;
        long long brr[b];
        for(int i=1; i<=b; i++) cin>>brr[i];

        for(int i=1; i<=a; i++)
        {
            for(int j=1; j<=b; j++)
            {
                int x = brr[j]-arr[i];
                x=abs(x);
                if(x%2==0) count++;
                else {}
            }
        }
        cout<<count<<endl;
        count=0;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
              ios_base::sync_with_stdio (false);
  cin.tie (NULL);
    long long t=0,v=0,sum=0,dum=0,z=0;
    cin>>t;
    long long arr[t];
    double b=t;
    double x = b/2;
       long long a = ceil(x);
   for(int i=0; i<t; i++)
   {
       cin>>arr[i];
   }
   sort(arr,arr+t,greater<int>());

   for(int i=0; i<a; i++) sum+=arr[i];
   for(int j=a; j<t; j++) dum+=arr[j];
   t = ceil(pow(sum,2));
   v = pow(dum,2);
   z = t + v;
   cout<<z<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int a,x,y,t,v,e1=0,e2=0,o1=0,o2=0;
    cin>>a;
    for(int i=0; i<a; i++)
    {
        cin>>x;
        for(int i=0; i<x; i++)
        {
            cin>>t;
            if(t%2==0) e1++;
            else o1++;
        }
        cin>>y;
        for(int i=0; i<y; i++)
        {
            cin>>v;
            if(v%2==0) e2++;
            else o2++;
        }
        long long int ans= (e1*e2)+(o1*o2);
        cout<<ans<<endl;
       e1=0,e2=0,o1=0,o2=0;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
      ios_base::sync_with_stdio (false);
           cin.tie (NULL);
     long long int t;
     cin>>t;
     while(t--)
     {
         long long a;
         cin>>a;
        long long z = a;
         long long arr[a];
         long long brr[a];
         for(long long i=0; i<a; i++)
         {
             cin>>arr[i];
             brr[i] =arr[i];
         }
         sort(arr,arr+a);
         long long x = arr[0];
         long long y= arr[z-1];
         for(long long i=0; i<a; i++)
         {
             if(brr[i]==x)
             {
                 cout<<x<<" "<<y<<endl;
                 break;
             }
             else if(brr[i]==y)
             {
                 cout<<y<<" "<<x<<endl;
                 break;
             }
         }
     }
    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
      ios_base::sync_with_stdio (false);
           cin.tie (NULL);

           int t, count=0;
           cin>>t;
           while(t--)
           {
               int a;
               cin>>a;
               int arr[a];
               for(int i=0; i<a; i++) cin>>arr[i];
               sort(arr,arr+a);
               if(a==1) cout<<"1"<<endl;
               else if(a==2)
               {
                   if(abs(arr[1]-arr[0])>1) cout<<"1"<<endl;
                   else cout<<"2"<<endl;
               }
               else
               {
                    for(int i=0; i<a-1; i++)
               {
                     if(abs(arr[i]-arr[i+1])==1)
                     {
                         count++;
                         //i++;
                     }
                     else
                     {
                         count--;
                     }

               }
               if(count==0) cout<<"1"<<endl;
               else
               {
                int x = count;
               cout<<x<<endl;
               count=0;
               }
               }
           }

    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;
int main()
{
      ios_base::sync_with_stdio (false);
           cin.tie (NULL);

         int t;
         cin>>t;
         while(t--)
         {
             int a;
             cin>>a;
             int arr[a];
             for(int i=0; i<a; i++) cin>>arr[i];
             sort(arr,arr+a);
             if(a==1) cout<<"1"<<endl;
             else if(a==2)
             {
                 if(arr[1]-arr[0]>1) cout<<"1"<<endl;
                 else if(arr[1]-arr[0]==1)  cout<<"2"<<endl;
             }
            else
            {
                for(int i=0; i<a; i++)
                {
                    if(abs(arr[i]-arr[i+1])cout<<"2"<<endl;
            }
         }

    return 0;
}*/

/*#include<bits/stdc++.h>
using namespace std;

void selectionSort(int a[], int n) {
   int i, j, min, temp;
   for (i = 1; i <= n - 1; i++) {
      min = i;
      for (j = i + 2; j <= n; j++)
         if (a[j] < a[min])
            min = j;
      temp = a[i];
      a[i] = a[min];
      a[min] = temp;
   }
}

int main()
{
    int t;
    cin>>t;

    while(t--)
    {
        int n;
        cin>>n;
        int a[n+1];
        //int j=1;
        for(int i=1;i<=n;i++)
        {
            a[i]=0;
           // j++;
        }

        int m;
        cin>>m;

        int b[m+1];

        for(int k=1;k<=m;k++)
        {
            cin>>b[k];
            a[b[k]]++;
        }

        //selectionSort(a,n);


        int count=0,mount=0;

        for(int i=1;i<n;i++)
        {
            if(a[i+1]>a[i])
                {
                    count++;
                }
            else
                mount++;
        }


        if(count !=0)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;


        for(int i=1;i<=n;i++)
            cout<<endl<<" "<<a[i]<<" ";


    }


    return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ios_base::sync_with_stdio (false);
    cin.tie (NULL);
     ll sum=0, dum=0;
    int x;
    ll arr[10000] = {'b'};
    int x1 = 0;
    arr[x1]= {'w'};
    cin>>x;
    while(x--)
    {
        ll a,b;
    cin>>a>>b;
    if(a<b) swap(a,b);
    for(int i=1; i<10000; i++)
    {
        if(i>=a && arr[i-a]=='w')
        {
            arr[i]='w';
        }
        else if(i>=b && arr[i-b]=='w')
        {
            arr[i]='w';
        }
        else
        {
            arr[i]='b';
        }

    }
    for(int i=0; i<10; i++)
    {
        if(arr[i]=='w') sum++;
            else dum++;
    }
    if(sum>dum) cout<<"Finite"<<endl;
    else if(sum==dum) cout<<"Finite"<<endl;
    else cout<<"Infinite"<<endl;
    sum =0,dum=0;
    }

    return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
using namespace std;


ll gcd(ll a, ll b)
{
	if (a == 0)
		return b;
	return gcd(b%a, a);
}


ll commDiv(ll a,ll b)
{
	ll n = gcd(a, b);

	ll res = 0;
	for (ll i=1; i<=sqrt(n); i++)
	{

		if (n%i==0)
		{
			if (n/i == i)
				res += 1;
			else
				res += 2;
		}
	}
	return res;
}

int main()
{
        ios_base::sync_with_stdio (false);
    cin.tie (NULL);

	int x;
	cin>>x;
	while(x--)
    {
	ll a,b;
	cin>>a>>b;
	ll z = commDiv(a, b);
	if(z==1)
        cout<<"Finite"<<endl;
    else
        cout<<"Infinite"<<endl;
    }
	return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main ()
{
    ios_base::sync_with_stdio (false);
    cin.tie (NULL);

    ll dum=0,sum=0;
    string s;
    cin>>s;
    ll x = s.size();
    for(int i=0; i<x; i++)
    {
        if(s[i]=='>') dum++;
    }
    for(int i=1; i<=dum; i++)
    {
        sum+=i;
    }
    cout<<sum;

    return 0;
}*/

/*#include<iostream>
#define ll long long
using namespace std;
int main()
{
        ios_base::sync_with_stdio (false);
    cin.tie (NULL);

    ll t;
    cin>>t;
    while(t--)
    {
        ll a=0,b=0,n=0,s=0,z=0,sum=0,dum=0;
        cin>>a>>b>>n>>s;
     ll x = s/n;
     if(x<=a)
     {
         ll z = x * n;
         ll z1 = s - z;
         if(b>=z1)
         {
             cout<<"YES"<<'\n';
         }
         else
         {
             cout<<"NO"<<'\n';
         }
     }
     else
     {
         for(int i=1; i<=a; i++)
         {
             sum+=a;
             if(sum==s)
             {
                 cout<<"YES"<<'\n';
                 break;
             }
         }
        for(int i=1; i<=b; i++)
                 {
                     dum+=b;
                     if(dum==s)
                        {
                            cout<<"YES"<<'\n';
                            break;
                     }
                     else if(i=b && sum!=s)
                        {
                            cout<<"NO"<<'\n';
                            break;
                     }
                 }
             }
     }

    return 0;
}*/

/*#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ios_base::sync_with_stdio (false);
    cin.tie (NULL);

    ll t;
    cin>>t;
    while(t--)
    {
        ll n,i,j,count=0;
        cin>>n;
        string a,b;
        cin>>a>>b;
        for(i=0; i<n; i++)
        {
          if(a[i]!=b[i])
          {
              break;
          }
        }
        for(j=n-1; j>=0; j--)
        {
            if(a[j]!=b[j])
            {
                char x = a[i];
                a[i] = b[j];
                b[j] = x;
                break;
            }
        }

        for(int i=0; i<n; i++)
        {
            if(a[i]==b[i]) count++;
        }
        if(count==n) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;

    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define d double
#define ll long long
#define lld long long double
#define ld long double
#define s string
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
    ios;
    ll x;
    s s;
    cin>>s;
    ll l = s.size();
    for(int i=0; i<l-1; i++)
    {
        x = i;
        if(s[i]=='A' && s[i+1]=='B')
        {
            for(int i=i+2; i<l; i++)
            {
                if(s[i]=='B' && s[i+1]=='A')
                    {cout<<"YES\n"; return 0;}
            }
        }

        if(s[x]=='B' && s[x+1]=='A')
        {
            for(x=x+2; x<l; x++)
            {
                if(s[x]=='A' && s[x+1]=='B')
                    {cout<<"YES\n"; return 0;}
            }
        }
    }
            cout<<"NO\n";
        return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define d double
#define ll long long
#define lld long long double
#define ld long double
#define s string
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{
    ios;

    ll n,count=0,brrcount=0,i;
    cin>>n;
    ll arr[n],brr[n];
    for(i=0; i<n; i++)
    {
        cin>>arr[i];
    }
    sort(arr+1,arr+n,greater<ll>());
    if(arr[0]>arr[1]) cout<<"0\n";
    else
    {
    for(i=0; i<n; i++)
    {
        if(arr[i+1]>=arr[i])
        {
            brr[i]=arr[i+1];
            brrcount++;
        }
    }
    while(true)
    {
       for(i=0; i<brrcount-1; i++)
       {
           if(arr[0]<<brr[i])
           {
               arr[0]++;
               brr[i]--;
               count++;
           }
       }
       if(arr[0]>brr[0])
       {
           cout<<count<<endl;
           return 0;
       }
    }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define D double
#define LL long long
#define LLD long long double
#define LD long double
#define S string
#define PI 3.14159265
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
int main()
{
   IOS;

   LL n,a=0,b=0,c=0,d=0,sum=0,x=0,y=0,z=0;
   LL acount=0, bcount=0, ccount=0, dcount=0;
   cin>>n;
   LL arr[n];
   for(int i=0; i<n; i++)
   {
       cin>>arr[i];
   }
   sort(arr,arr+n);
   for(int i=0; i<n; i++)
   {
       if(arr[i]==1) a++;
       else if(arr[i]==2) b+=2;
       else if(arr[i]==3) c+=3;
       else if(arr[i]==4) d+=4;
   }
       if(a%4==0)
       {
         acount = a/4;
       }
       if(b%4==0)
       {
           bcount = b/4;;
       }
       if(c%4==0)
       {
           ccount = c/4;
       }
       if(d%4==0)
       {
           dcount = d/4;
       }

           if(a%4!=0) sum+=a;
           if(b%4!=0) sum+=b;
           if(c%4!=0) sum+=c;
           if(d%4!=0) sum+=d;
               x = sum/4;
               y = sum%4;
               z = acount+bcount+ccount+dcount+x+y;
               if(a==n || b==n || c==n || d==n)
               {
                   cout<<n/4<<endl;
               }
               else if(z<4)
               {
                   cout<<"1\n";
               }
               else
               {
                   cout<<z<<endl;
               }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
//#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("in.txt","r",stdin)
#define WRITE  		freopen("out.txt","w",stdout)
using namespace std;

LLI dec(LLI x)
{
    LLI sum=0,z=0,a;
    while(x>0)
    {
        a = x%10;
        sum=sum+a*pow(2,z);
        x=x/10;
        z++;
    }
    return sum;
}
int main()
{
   //IOS;

    LLI a,b,c,d,e,f,g,h,i,n;
    C s;
    cin>>n;
    for(int i=1; i<=n; i++)
    {
        cin>>a>>s>>b>>s>>c>>s>>d;
        cin>>e>>s>>f>>s>>g>>s>>h;

        if(a==dec(e) && b==dec(f) && c==dec(g) && d==dec(h))
            cout<<"Case "<<i<<": Yes\n";
        else cout<<"Case "<<i<<": No\n";
    }
   return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{
    IOS;
    READ;
    WRITE;
    int b,g,count=0;
    cin>>b>>g;
    int z = b+g;
    char zarr[z];
    if(b==g)
    {
    memset(zarr,'B',sizeof(zarr));
    for(int i=1; i<z; i+=2)
    {
        if(count==g) break;
        else
        {
            zarr[i] = 'G';
            count++;
        }
    }
    for(int i=0; i<z; i++)
    {
        cout<<zarr[i];
    }
    }
    else
    {
        int mini = min(b,g);
        if(mini==g)
        {
          memset(zarr,'B',sizeof(zarr));

            for(int i=1; i<g*2; i+=2)
            {
                zarr[i]='G';
            }
        }
        else
        {
        memset(zarr,'G',sizeof(zarr));
        for(int i=1; i<b*2; i+=2)
        {
            zarr[i]='B';
        }
        }
    for(int i=0; i<z; i++)
    {
        cout<<zarr[i];
    }

    }

   return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{
    IOS;
   while(true)
   {
       LL t;
       cin>>t;
       LL n,m,x,y;
       if(t==0) break;
       else
       {
           cin>>n>>m;
       for(int i=1; i<=t; i++)
       {
           cin>>x>>y;
           if(n==x || n==y || m==x || m==y)
            cout<<"divisa\n";
           else
           {
               if(x>n && y>m) cout<<"NE\n";
               else if(x<n && y>m) cout<<"NO\n";
               else if(x<n && y<m) cout<<"SO\n";
               else if(x>n && y<m) cout<<"SE\n";
           }
       }
       }
   }

   return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{

IOS;

   LL n,a=0,b=0,c=0,d=0,count=0,sum=0,x=0,y=0,z=0;
   LL acount=0, bcount=0, ccount=0, dcount=0;
   cin>>n;
   LL arr[n];
   for(int i=0; i<n; i++)
   {
       cin>>arr[i];
   }
   sort(arr,arr+n);
   for(int i=0; i<n; i++)
   {
       if(arr[i]==1) a++;
       else if(arr[i]==2) b+=2;
       else if(arr[i]==3) c+=3;
       else if(arr[i]==4) d+=4;
   }
       if(a%4==0)
       {
         acount = a/4;
       }
       if(b%4==0)
       {
           bcount = b/4;;
       }
       if(c%4==0)
       {
           ccount = c/4;
       }
       if(d%4==0)
       {
           dcount = d/4;
       }

           if(a%4!=0) sum+=a;
           if(b%4!=0) sum+=b;
           if(c%4!=0) sum+=c;
           if(d%4!=0) sum+=d;
           if(sum==0)
           {
               z = acount+bcount+ccount+dcount;
           }
               else if(sum>=4)
               {
                   x = sum/4;
                   if(sum%4>=1) y=1;
                   z = acount+bcount+ccount+dcount+x+y;
               }
               else if(sum==1 || sum==2 || sum==3)
               {
                   x = 1;
                   z = acount+bcount+ccount+dcount+x;
               }

            cout<<z<<endl;

    return 0;

}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{

IOS;

    LL z;
    cin>>z;
    while(z--)
    {
        LL n,x,a,b;
        cin>>n>>x>>a>>b;
        LL tempo;
        if(a>b)
        {
            tempo=a;
            a=b;
            b=tempo;
        }
        while(true)
        {
            if(a==1 && b==n) break;
            if(x==0) break;
            if(a==1) {}
            else
            {
                a=a-1;
                x--;
            }
            if(x==0) break;
            if(b==n) {}
            else
            {
                b=b+1;
                x--;
            }
        }
        cout<<abs(a-b)<<endl;
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{

    //IOS;

    LL z;
    cin>>z;

    while(z--)
    {
        LL x,y;
        cin>>x>>y;
        if(x==y) cout<<"YES\n";
        else if(x>y) cout<<"YES\n";
        else if(x<y)
        {
            if(x%2==0 && x>=4) cout<<"YES\n";
            else if(x>=4) cout<<"YES\n";
            else if(x==2 && y==3) cout<<"YES\n";
            else cout<<"NO\n";
        }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULL unsigned long long
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{

    IOS;

    LL t,a=0,b=0,c=0,d=0,ca=0,Ac=0;
    cin>>t;
    LL arr[t];
    for(int i=0; i<t; i++)
    {
        cin>>arr[i];
    }
    for(int i=0; i<t; i++)
    {
        if(arr[i]==1) a++;
        if(arr[i]==2) b++;
        if(arr[i]==3) c++;
        if(arr[i]==4) d++;
    }
    if(c==a) {ca = (c+a)/4;
    D xc = (2*b)/4.00;
    LL x= ceil(xc);
    cout<<d+c+x;}
    else if(a>c) {Ac = a-c;
    D xc = ((2*b)+Ac)/4.00;
    LL x = ceil(xc);
    cout<<d+c+x;}
    else {D xc = (2*b)/4.00;
    LL x = ceil(xc);
    cout<<d+c+x;}
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    LL x,a;
    cin>>x;
    LL xx = x;
    LL xarr[x],yarr[x];
    memset(xarr,0,sizeof(xarr));
    memset(yarr,0,sizeof(yarr));
    for(int i=1; i<=x; i++)
        {
            cin>>a;
            xarr[a]=i;
            yarr[a]=xx;
            xx--;
        }
    LL z,w,m=0,n=0;
    cin>>z;
    while(z--)
    {
        cin>>w;
        m+=xarr[w];
        n+=yarr[w];
    }
    cout<<m<<" "<<n<<endl;
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    LL n,k,count=0;
    cin>>n>>k;
    LL arr[n];
    LL brr[n];
    LL crr[n];
    memset(arr,0,sizeof(arr));
    memset(brr,0,sizeof(brr));
    memset(crr,0,sizeof(crr));
    for(int i=1; i<=n; i++)
   {
       cin>>arr[i]>>brr[i];
   }
   for(int i=1; i<n; i++)
   {
       for(int j=i+1; j<=n; j++)
       {
           if(arr[i]<arr[j])
           {
               swap(arr[i],arr[j]);
               swap(brr[i],brr[j]);
           }
           if(arr[i]==arr[j])
           {
               if(brr[i]>brr[j])
               {
                   swap(brr[i],brr[j]);
                   swap(arr[i],arr[j]);
               }
           }
       }
   }

    for(int i=1; i<=n; i++)
    {
        if(arr[k]==arr[i] && brr[k]==brr[i]) count++;
    }
    cout<<count<<endl;

    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    IOS;
    LL n,k,temp=1,sum=0;
    cin>>n>>k;
    LL arr[n];
    memset(arr,0,sizeof(arr));

    for(int i=0; i<n; i++) cin>>arr[i];

    if(n==1 && k==1) cout<<"1\n";

    else
    {
        for(int i=0; i<k; i++) sum+=arr[i];

        LL dum = sum;
        for(int i=k; i<n; i++)
        {
             dum = dum + arr[i] - arr[i-k];
             if(dum<sum)
             {
                 sum = dum;
                 temp = i-(k-2);
             }
        }
        cout<<temp<<endl;
    }

    return 0;
}
*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    IOS;
    LL t,a,b;
    cin>>t;
    while(t--)
    {
        cin>>a>>b;
        if(a-b==1) cout<<"NO\n";
            else cout<<"YES\n";
    }

    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    IOS;
    LLI t,count=0,bount=0;
    cin>>t;
    //if(t%2==0) cout<<"1\n";
        while(1)
        {
            if(t%2==1) count++;
            t/=2;
            if(t<=0) break;
        }
            cout<<count<<endl;

    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    IOS;
    LLI t,x,y,z,xx=0,yy=0,zz=0;
    cin>>t;
     for(int i=1; i<=t; i++)
     {
        cin>>x>>y>>z;
            xx+=x;
            yy+=y;
            zz+=z;
     }
     if(xx==0 && yy==0 && zz==0) cout<<"YES\n";
     else cout<<"NO\n";

    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    IOS;

    LL x;
    cin>>x;
    LL z = x*x;
    cout<<z<<endl;

    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    IOS;
    LL t,count=0;
    cin>>t;
    LL z = t/2;
    char arr[t];
    char xrr[z];
    char yrr[z];
    memset()
    for(int i=0; i<t; i++)
    {
        cin>>arr[i];
    }
        if(t%2==1) cout<<"NO\n";
        else
        {
    for(int i=0; i<z; i++)
    {
        xrr[i] = arr[i];
    }
    LL j=0;
    for(int i=z; i<t; i++)
    {
        yrr[j] = arr[i];
        j++;
    }
    for(int i=0; i<z; i++)
    {
        if(xrr[i]==yrr[i]) count++;
    }
    if(count==z) cout<<"Yes\n";
    else cout<<"No\n";
        }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;
int main()
{
    IOS;
    int t,sum=0;
    cin>>t;

    string s;
    cin>>s;

    if((t%2)==1)
        cout<<"No"<<endl;
    else
    {
    char brr[t+1],arr[t+1];
    int j=0;

    for(int i=0;i<t/2;i++)
        arr[i]=s[i];

    for(int i=t/2;i<t;i++)
        {
            brr[j]=s[i];
            j++;
        }
    for(int i=0;i<t/2;i++)
    {
        if(arr[i]==brr[i])
            sum++;
        else
            break;
    }
    if(sum==t/2)
        cout<<"Yes"<<endl;
    else
        cout<<"No"<<endl;

    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;
int main()
{
   // IOS;
        LL t;
        cin>>t;
        while(t--)
        {
            LL a,temp=0,count=0;
            cin>>a;
            LL arr[a];
            LL brr[a];
            LL krr[a];
            memset(krr,0,sizeof(krr));
            for(int i=0; i<a; i++) cin>>arr[i];
            for(int i=0; i<a; i++) cin>>brr[i];

            if(a==1)
            {
                if(arr[0]<=brr[0])
                {
                    cout<<"YES\n";
                }
                else cout<<"NO\n";
            }
            else
            {
                for(int i=0; i<a; i++)
                {
                    if(arr[i]==brr[i]) count++;
                }
                if(count==a)
                {
                    cout<<"YES\n";
                }
                else
                {
                    LL j=0;
                for(int i=0; i<a; i++)
                {
                    if(arr[i]!=brr[i])
                    {
                        krr[j]= i;
                        j++;
                    }
                }
                for(int i=0; i<j; i++)
                {
                    if(abs(krr[i]-krr[i+1]) != 1)
                    {
                        cout<<"NO\n";
                        break;
                    }
                    else
                    {
                        cout<<"YES\n";
                        break;
                    }
                }
                }
            }
        }
return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;
int main()
{
    IOS;
    LL row = 0, column = 0;
  LL arr[6],brr[6],crr[6],drr[6],err[6];
  for(int i=1; i<=5; i++)
  {
      cin>>arr[i]>>brr[i]>>crr[i]>>drr[i]>>err[i];
  }
  for(int i=1; i<=5; i++)
  {
      if(arr[i]==1) { row = i; column = 1; break;}
      else if(brr[i]==1) { row = i; column = 2; break;}
      else if(crr[i]==1) { row = i; column = 3; break;}
      else if(drr[i]==1) { row = i; column = 4; break;}
      else if(err[i]==1) { row = i; column = 5; break;}
  }
  cout<<abs((3-row))+abs((3-column))<<endl;
return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()

{
    LL t;
    cin>>t;
    while(t--)
    {
        LL a,b;
        LL bum=0,dum=0,sum=0;
        cin>>a>>b;
        if(a==b) cout<<"0\n";
        else
        {
            LL x = abs(a-b);
            if(x==1) cout<<"1\n";
            else if(x==2) cout<<"1\n";
            else if(x==3 || x==4) cout<<"2\n";
            else if(x==5) cout<<"1\n";
                else
            {
                if(x%5==0)
                {
                    bum = x/5;
                    cout<<bum<<endl;
                }
                else
                {
                    bum = x/5;
                    LL y = x - (bum*5);
                    if(y<=2)
                    cout<<bum+1<<endl;
                    else if(y>2) cout<<bum+2<<endl;
                }

            }
        }
    }
    return 0;
}*/

/*#include<bits/stdc++.h>
#include<iomanip>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
using namespace std;

int main()
{
    LL n,count=0;
    cin>>n;

    for(int i=n+1; i<100000; i++)
    {
        LL z = i;
    LL arr[5];
    for(int j=4; j>=1; j--)
    {
        LL x = z%10;
        arr[j] = x;
        z = z/10;
    }
    for(int j=1; j<=4; j++)
    {
        if(arr[1] != arr[2] && arr[1] != arr[3] && arr[1] != arr[4] && arr[2] != arr[3] && arr[2] != arr[4] && arr[3] != arr[4]){}
        else
        {
          count++;
        }
    }
    if(count==0)
    {
        for(int i=1; i<=4; i++) {cout<<arr[i];} return 0;
    }
    else
    {
        count=0;
        memset(arr,0,sizeof(arr));
    }
    }
}*/
#include<bits/stdc++.h>
#define C char
#define D double
#define F float
#define LL long long
#define ULLI unsigned long long int
#define LLI long long int
#define LLD long long double
#define LD long double
#define S string
#define PI (2.0*acos(0.0))
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define READ 		freopen("input.txt","r",stdin)
#define WRITE  		freopen("output.txt","w",stdout)
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;
}







Measured memory_bytes: 256