On a chessboard with a width of $$$n$$$ and a height of $$$n$$$, rows are numbered from bottom to top from $$$1$$$ to $$$n$$$, columns are numbered from left to right from $$$1$$$ to $$$n$$$. Therefore, for each cell of the chessboard, you can assign the coordinates $$$(r,c)$$$, where $$$r$$$ is the number of the row, and $$$c$$$ is the number of the column.The white king has been sitting in a cell with $$$(1,1)$$$ coordinates for a thousand years, while the black king has been sitting in a cell with $$$(n,n)$$$ coordinates. They would have sat like that further, but suddenly a beautiful coin fell on the cell with coordinates $$$(x,y)$$$...Each of the monarchs wanted to get it, so they decided to arrange a race according to slightly changed chess rules:As in chess, the white king makes the first move, the black king makes the second one, the white king makes the third one, and so on. However, in this problem, kings can stand in adjacent cells or even in the same cell at the same time.The player who reaches the coin first will win, that is to say, the player who reaches the cell with the coordinates $$$(x,y)$$$ first will win.Let's recall that the king is such a chess piece that can move one cell in all directions, that is, if the king is in the $$$(a,b)$$$ cell, then in one move he can move from $$$(a,b)$$$ to the cells $$$(a + 1,b)$$$, $$$(a - 1,b)$$$, $$$(a,b + 1)$$$, $$$(a,b - 1)$$$, $$$(a + 1,b - 1)$$$, $$$(a + 1,b + 1)$$$, $$$(a - 1,b - 1)$$$, or $$$(a - 1,b + 1)$$$. Going outside of the field is prohibited.Determine the color of the king, who will reach the cell with the coordinates $$$(x,y)$$$ first, if the white king moves first.

The first line contains a single integer $$$n$$$ ($$$2 \le n \le 10^{18}$$$) — the length of the side of the chess field. The second line contains two integers $$$x$$$ and $$$y$$$ ($$$1 \le x,y \le n$$$) — coordinates of the cell, where the coin fell.

In a single line print the answer "White" (without quotes), if the white king will win, or "Black" (without quotes), if the black king will win. You can print each letter in any case (upper or lower).

NoteAn example of the race from the first sample where both the white king and the black king move optimally: The white king moves from the cell $$$(1,1)$$$ into the cell $$$(2,2)$$$. The black king moves form the cell $$$(4,4)$$$ into the cell $$$(3,3)$$$. The white king moves from the cell $$$(2,2)$$$ into the cell $$$(2,3)$$$. This is cell containing the coin, so the white king wins.  An example of the race from the second sample where both the white king and the black king move optimally: The white king moves from the cell $$$(1,1)$$$ into the cell $$$(2,2)$$$. The black king moves form the cell $$$(5,5)$$$ into the cell $$$(4,4)$$$. The white king moves from the cell $$$(2,2)$$$ into the cell $$$(3,3)$$$. The black king moves from the cell $$$(4,4)$$$ into the cell $$$(3,5)$$$. This is the cell, where the coin fell, so the black king wins.  In the third example, the coin fell in the starting cell of the black king, so the black king immediately wins.

#include<stdio.h>
#include<math.h>
int main()
{
    long long n,a,b,d;
    double dis_w,dis_b;
    scanf("%lld%lld%lld",&n,&a,&b);
    long long w,bl;
    w=(a+b-2);
    bl=(2*n-(a+b));
    if(bl<w)
        printf("Black");
    else
        printf("White\n");

}

#include<stdio.h>
#include<math.h>

int main()
{
	long long int n;
	long long int x,y;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	long double dw1,dw2 ;
	long double distw,distb;

	dw1 = dw2 = distw = distb = 0;
	dw1=powl((x-1),2);
	dw2=powl((y-1),2);
	distw=powl((dw1+dw2),0.5);

	dw1 = dw2 = 0;
	dw1=powl((n-x),2);
	dw2=powl((n-y),2);
	distb=powl((dw1+dw2),0.5);

	if(distw>distb)
		printf("Black");
	else
		printf("White");

	return 0;
}

#include<stdio.h>
#define ll unsigned long long int
int main(){
	ll n,x,y;
	scanf("%lld %lld %lld", &n,&x,&y);
	ll wt ,bl, count =0;
	if(x==n&&y==n){
		printf("Black\n");
		return 0;
	}else if(x==1&& y==1){
		printf("White\n");
		return 0;
	}
	else{
		wt = (x-1)>(y-1)?(x-1):(y-1) ;
		bl = (n-x+1)>(n-y+1)?(n-x+1):(n-y+1);
//		printf("%lld %lld %lld", wt,bl, n-y+1);
	}
	if(wt < bl){
		printf("White\n" );
	}else
		printf("Black\n");
}

#include <stdio.h>
#include <math.h>
int main(){
	long long int n,c1,c2;
	long double bk,bx,by,wk,wx,wy;
	scanf("%I64d",&n);
	scanf("%I64d",&c1);
	scanf("%I64d",&c2);

	bx=c1-n;
	bx= powl((bx),2);
	by=c2-n;
	by=powl((by),2);
	bk=sqrtl(bx+by);

	wx=c1-1;
	wx= powl((wx),2);
	wy=c2-1;
	wy=powl((wy),2);
	wk=sqrtl(wx+wy);

	if(wk<=bk){
		printf("White");
    }else{
		printf("Black");
	}
	return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int a,b,c,n,o;
	scanf("%I64lld",&a);
	scanf("%I64lld %I64lld",&b,&c);
	n=((2*a)-(b+c));
	o=((b+c)-2);
	if(n<o)
	printf("black");
	else
	printf("white");
	return 0;
}

#include<stdio.h>

int main()
{
	long long int n,x,y,a,b,a1,b1,c1=0,c2=0,r1,r2,s1,s2;
	scanf("%lld%lld%lld",&n,&x,&y);
	a=b=1;
	a1=b1=n;
	int t=1;
	while(t--)
	{
		if(a==x&&b==y)
		{
			printf("White\n");
			break;
		}
		if(a1==x&&b1==y)
		{
			printf("Black\n");
			break;
		}
		if(a!=x&&b!=y)
		{
			r1=x-a;
			r2=y-b;
		//	printf("White r1 %lld r2 %lld\n",r1,r2);
			if(r1<r2)
			{
				c1+=r1;
				a+=r1;
				b+=r1;
		//		printf("White a %lld b %lld c1 %lld diff %lld\n",a,b,c1,y-b);
				c1+=y-b;
				b=y;
			}
			if(r2<r1)
			{
				c1+=r2;
				a+=r2;
				b+=r2;
		//		printf("White a %lld b %lld c1 %lld\n",a,b,c1);
				c1+=x-a;
				a=x;
			}
			if(r1==r2)
			{
				c1=r1;
				a=r1;
				b=r1;
		//		printf("White a %lld b %lld c1 %lld\n",a,b,c1);

			}
		}
		if(a==x&&b!=y)
		{
			c1=y-b;
			b=y;
		}
		if(a!=x&&b==y)
		{
			c1=x-a;
			a=x;
		}
	//	printf("x %lld y %lld a1 %lld b1 %lld\n",x,y,a1,b1);

		if(a1!=x&&b1!=y)
		{
			s1=a1-x;
			s2=b1-y;
	//		printf("Black s1 %lld s2 %lld\n",s1,s2);
			if(s1<s2)
			{
				c2+=s1;
				a1-=s1;
				b1-=s1;
	//			printf("Black a1 %lld b1 %lld c2 %lld diff %lld\n",a1,b1,c2,b1-y);
				c2+=b1-y;
				b1=y;
			}
			if(s2<s1)
			{
				c2+=s2;
				a1-=s2;
				b1-=s2;
	//			printf("Black a1 %lld b1 %lld c2 %lld diff %lld\n",a1,b1,c2,a1-x);
				c2+=a1-x;
				a1=x;
			}
			if(s1==s2)
			{
				c2=s1;
				a1=s1;
				b1=s1;
	//			printf("Black a1 %lld b1 %lld c2 %lld\n",a1,b1,c2);

			}
		}
		if(a1==x&&b1!=y)
		{
			c2=b1-y;
			b1=y;
		}
		if(a1!=x&&b1==y)
		{
			c2=a1-x;
			a1=x;
		}
		if(c1<=c2)
	    printf("White\n");
	    else
	    printf("Black\n");
		//if(a==x&&b==y)
		//break;
		//if(a1==x&&b1==y)
		//break;
	}
	//printf("c1 %lld c2 %lld\n",c1,c2);
	//if(c1<=c2)
	//printf("White\n");
	//else
	//printf("Black\n");
	return 0;
}

#include<stdio.h>

int main(){

    long long int r,c,n;

    scanf("%lld",&n);
    scanf("%lld",&r);
    scanf("%lld",&c);

   long long int a=r+c-2;
   long long int b=(2*n)-(r+c);

  if(a<=b){

	  printf("white");
  }

  else{

	  printf("black");
  }

  return 0;
}

#include<stdio.h>
#include<math.h>
 int main() {
	unsigned long long n,x,y;
	scanf("%llu",&n);
	scanf("%llu %llu",&x,&y);
if((x+y)<(n+2)) {printf("white");}
	else {printf("black");}
return 0;
}

#include<stdio.h>
#include<math.h>

int main()
{
	long long int n, x, y;

	scanf("%I64d", &n);
	scanf("%I64d %I64d", &x, &y);

	if((powl(powl(x-1,2) + powl(y-1,2), 0.5) <= powl(powl(x-n,2) + powl(y-n,2), 0.5))) {
			printf("White");
	}
	else {
		printf("Black");
	}

	return 0;

}

#include<stdio.h>
int main()
{
    unsigned long long int n,a,b,x,y;
    scanf("%I64u%I64u%I64u",&n,&a,&b);

    if((a-1)>(b-1))
    x=a-1;
    else
        x=b-1;
    if((n-a)>(n-b))
    y=n-a;
    else
        y=n-b;
    if(x<=y)
        printf("White\n");
    else
        printf("Black\n");
    return 0;
}

#include<stdio.h>
long long int max(long long int a,long long int b)
{
 if(a>b)
	 return a;
 else
	 return b;
}
int main(void)
{
  long long int n;
  scanf("%lld",&n);
  long long int x,y;
  scanf("%lld %lld",&x,&y);
  long long int d1,d2;
  d1=max(x-1,y-1);
  d2=max(n-x,n-y);
  if(d1>d2)
	  printf("black\n");
  else
	  printf("white\n");
}

#include <stdio.h>
#include <math.h>
void WIN(long long n,long long x,long long y)
{
	long long Sum=0;
	long long Sum1=0;
	Sum=(x-1)+(y-1);
	Sum1=(n-x)+(n-y);
	if(Sum<=Sum1)
	{
		printf("WHITE");
	}
	else
	{
		printf("BLACK");
	}
}
int main()
{
	long long n,x,y;
	scanf("%I64d",&n);
	scanf("%I64d",&x);
	scanf("%I64d",&y);
	WIN(n,x,y);
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
   long long int n,x,y,w,b;
   scanf("%lld %lld %lld",&n,&x,&y);
   w=(x-1)+(y-1);
   b=(n-x)+(n-y);
   if(w<=b)
   {
       printf("white");
   }
   else
   {
    printf("black");
   }
}

#include<stdio.h>

int main()
{
    unsigned long long int n, x, y;
    scanf("%I64d %I64d %I64d", &n, &x, &y);
    unsigned long long int countw, countb, temp;
    if(x==y)
    {
        countw=x-1;  countb=n-x;
    }
    else if(x>y)
    {
        countw=x-1;

        countb=n-y;
        n=n;
    }
    else
    {
        countw=y-1;

        countb=n-x;
    }

    if(countb<countw)
        printf("Black");
    else
        printf("White");
}

#include<stdio.h>

int main()
{
    unsigned long long int x, y, n;
    unsigned long long int w,b;
    scanf("%I64d",&n);
    scanf("%I64d %I64d",&x, &y);
    w=((x-1)+(y-1));
    b=((n-x)+(n-y));
    if(w<=b)
        {printf("White");}
    else
        {printf("Black");}
    return 0;
}

#include<stdio.h>
long long max(long long x, long long y)
{

	if (x>y)
	{
		return x;
	}
	else
	{
		return y;
	}
}

long long min(long long x, long long y)
{

	if (x<y)
	{
		return x;
	}
	else
	{
		return y;
	}
}

 long long main()
{
	long long x,y,n;
	scanf("%I64d %I64d %I64d",&n,&x,&y);
	if (max(x,y)-1 > n-min(x,y))
	{
		printf("black");
	}
	else
	{
		printf("white");
	}
	return 0;
}

#include <stdio.h>
int main()
{
	long long int n,x,y,w,b;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	w=(x-1)+(y-1);
	b=(n-x)+(n-y);
	if(w<=b)
		printf("White");
	else
		printf("Black");
	return 0;
}

#include <stdio.h>

int main(){
    long long int n , x , y ;
    scanf("%I64d",&n);
    scanf("%I64d%I64d",&x,&y);
    if(x+y-1 <= n){
        printf("White");
    }
    else
    {
        printf("Black");
    }
    return 0 ;
}

#include <stdio.h>
int main()
{
	long long int n;
	scanf("%I64d",&n);
	long long int x,y;
	scanf("%I64d%I64d",&x,&y);

	if(x+y>n+1)
	{
		printf("Black\n");
	}
	else
	{
		printf("White\n");
	}

	return 0;
}

#include <stdio.h>

 int main()
 { long long int n,x,y;
   long long int w,b ;
	 scanf("%lld",&n);
	 scanf("%lld %lld",&x,&y);
	 w=(x-1) + (y-1);
	 b=(n-x) + (n-y);
	 if (w>b)
{
	printf("Black");
}
else{
	printf("White");
}
}

# include<stdio.h>
int main(){
long long int n,x,y;
scanf("%lld%lld%lld", &n,&x,&y);
if((x+y)>=(n+2)){
printf("Black");
}
else{
printf("White");
}
}

#include <stdio.h>

int main() {
	long long n;scanf("%I64d",&n);long long x,y;
	scanf("%I64d%I64d",&x,&y);
	 if(x+y<=n+1){
	    printf("%s","White");
	}
	else if(x+y>=n+2){
	    printf("%s","Black");
	}
		return 0;
}

#include <stdio.h>
int main(int argc, char **argv)
{
	long long n, x, y, a,b;
	scanf("%I64d\n", &n);
	scanf("%I64d%I64d", &x, &y);
	a=(x-1) + (y-1);
	b=(n-x) +(n-y);
	if(a>b)
	printf("Black");
	else
	printf("White");
	return 0;
}

#include<stdio.h>

int main(){

    long long int r,c,n;

    scanf("%lld",&n);
    scanf("%lld",&r);
    scanf("%lld",&c);

   long long int a=r+c-2;
   long long int b=(2*n)-(r+c);

  if(a<=b){

	  printf("white");
  }

  else{

	  printf("black");
  }

  return 0;
}

#include <stdio.h>

int main()
{
	long long n, x, y;
	scanf("%I64d%I64d%I64d", &n, &x, &y);

	if (x + y > n + 1) {
		printf("Black");
	} else {
		printf("White");
	}
}

#include<stdio.h>
int main(){
long long n,x,y,s,k;
scanf("%I64d\n",&n);
scanf("%I64d",&x);
scanf("%I64d",&y);
s=(x-1)+(y-1);
k=(n-x)+(n-y);

if(s>k){printf("black");}
else{printf("white");}
return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
    long long int n, x, y;
    long double d1, d2;
    scanf("%I64d %I64d %I64d", &n, &x, &y);
    d1=sqrtl(powl(x-1,2)+powl(y-1,2));
    d2=sqrtl(powl(x-n,2)+powl(y-n,2));
    if(d1<=d2)
    {
        printf("White");
    }
    else
    {
        printf("Black");
    }
    return 0;
}

#include<stdio.h>
int main()
{
	long long int n,x,y,cnt1=0,cnt2=0,a,b;

	scanf("%lld%lld%lld",&n,&x,&y);

	if (x-1>y-1) cnt1=x-1;
	else cnt1=y-1;

	if (n-x>n-y) cnt2=n-x;
	else cnt2=n-y;

	if (cnt1>cnt2) printf("Black");
	else printf("White");
}

#include<stdio.h>
#include<math.h>
int main()
{
   long long int n,x,y,w,b;
   scanf("%lld %lld %lld",&n,&x,&y);
   w=(x-1)+(y-1);
   b=(n-x)+(n-y);
   if(w<=b)
   {
       printf("white");
   }
   else
   {
    printf("black");
   }
}

#include<stdio.h>
int main()
{
   long long int n,x,y,r1,r2;
    scanf("%lld",&n);
    scanf("%lld%lld",&x,&y);
    r1=(x-1)+(y-1);
    r2=(n-x)+(n-y);

    if(r1>r2)
    {
        printf("Black");
    }
    if(r1<=r2)
    {
        printf("White");
    }
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long n,x,y,s1,s2;
	scanf("%I64d",&n);
	scanf("%I64d",&x);
	scanf("%I64d",&y);
	s1=x+y-2;
	s2=2*n-x-y;
	if(s1>s2)
	{
		printf("Black\n");
	}
	else
	{
		printf("White\n");
	}
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int n,x,y;
	scanf("%lld",&n);
		scanf("%I64d %I64d",&x,&y);
			long double wd=sqrtl(powl((x-1),2)+powl((y-1),2));
		 long double bd=sqrtl(powl((x-n),2)+powl((y-n),2));

			if(wd<=bd)
			{
				printf("White");
			}
			else
			{
				printf("Black");
			}
			return 0;
		}

#include<stdio.h>
int main()
{
long long int x,y,k1,k2;
long long int n;
scanf("%lld",&n);
scanf("%lld %lld",&x,&y);
k1=x+y-2;
k2=n-x+n-y;
if(k1<=k2)
	{
	printf("White");
	}
else
	{
	printf("Black");
	}

return 0;
}

#include<stdio.h>
int main()
{
    unsigned long long int n,x,y,a,b;
    scanf("%llu\n",&n);
    scanf("%llu\t%llu",&x,&y);
    a=(x-1)+(y-1);
    b=(n-x)+(n-y);
    if(a==b || a<b)
    {
        printf("White");
    }
    else
    {
        printf("Black");
    }
}

#include<stdio.h>
#include<math.h>

int main()
{
long long int n,x,y;
scanf("%lld",&n);
scanf("%lld",&x);
scanf("%lld",&y);

long long int a,b;

a=sqrtl(powl(x-n,2)+powl(y-n,2));
b=sqrtl(powl(x-1,2)+powl(y-1,2));

if(a>=b)
	{
	 printf("White");
	}

else
	{
	printf("Black");
	}

return 0;
}

#include <stdio.h>

int main()
{
	long long int x,y,n,w,b;
	scanf("%I64d",&n);
	scanf("%I64d",&x);
	scanf("%I64d",&y);
	w=(x-1)+(y-1);
	b=(n-x)+(n-y);
	if(w<=b)
	   printf("white");
	   else
	   printf("black");

	return 0;
}

#include <stdio.h>
#include <stdlib.h>
long long int max(long long int a, long long int b)
{
    if(a<b)
        return b;
    else
        return a;
}
int main()
{
    long long int n, x, y;
    scanf("%lld %lld %lld", &n, &x, &y);
    long long int white, black;
    white=max(x-1, y-1);
    black=max(n-x, n-y);
    if(black<white)
        printf("Black");
    else
        printf("White");
    return 0;
}

#include<stdio.h>

int main()
{
	long long int n,a,b,k,l,j;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&a,&b);
	k=(n-a)+(n-b);
	l=(a-1)+(b-1);
	if(k>=l)
		printf("White");
	else
		printf("Black");
	return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int n,x,y;
	long double d1,d2,a,b;
	scanf("%I64d",&n);
	scanf("%I64d%I64d",&x,&y);
	a=powl((x-1),2) + powl((y-1),2);
	b=powl((n-x),2) + powl((n-y),2);
	d1=sqrtl(a);
	d2=sqrtl(b);
	if(d1<=d2)
	{
		printf("White");
		}
	if(d1>d2)
	{
		printf("Black");
		}
	return 0;
}

#include<stdio.h>
#include<math.h>
long long int len(long long int a,long long int b);
long long int x,y;
int main()
{

long long int n,w,bl;
scanf("%lld\n",&n);

scanf("%lld %lld",&x,&y);

long long int a=1,b=1;
long long int c=n,d=n;

w=len(a,b);
bl=len(c,d);
if(w>bl)
	printf("black");
else
	printf("white");
return 0;
}

long long int len(long long int a,long long int b)
{
long long int d;
d=sqrtl(powl((x-a),2)+powl((y-b),2));
return d;
}

#include <stdio.h>

int main() {
	long long n;scanf("%I64d",&n);long long x,y;
	scanf("%I64d%I64d",&x,&y);
	 if(x+y<=n+1){
	    printf("%s","White");
	}
	else if(x+y>=n+2){
	    printf("%s","Black");
	}
		return 0;
}

#include<stdio.h>
int main()
{
 unsigned long long  n,x,y,b,w;
scanf("%llu %llu %llu",&n,&x,&y);
 b=(n-x)+(n-y);
 w=(x-1)+(y-1);
 if(w>b)
 printf("black");
 else
 printf("white");
 }

#include<stdio.h>
#include<math.h>
int main()
{
    long long n,a,b,d;
    double dis_w,dis_b;
    scanf("%lld%lld%lld",&n,&a,&b);
    long long w,bl;
    w=(a+b-2);
    bl=(2*n-(a+b));
    if(bl<w)
        printf("Black");
    else
        printf("White\n");

}

#include<stdio.h>
int main()
{
 long long int n,min1,min2,x,y;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	if(x>y)
	{
 min1=n-x;
 min2=y-1;
 }
	else
	{
		min1=n-y;
		min2=x-1;
	}

	if(min1<min2)
	{
		printf("Black");
	}
else{
		printf("White");
	}
}

# include<stdio.h>

int main()
{
	long long int n,x,y,a,b;
	scanf("%I64d",&n);
	scanf("%I64d%I64d",&x,&y);
	a=(x-1)+(y-1);
	b=(n-y)+(n-x);
	if(a<=b)
		printf("White\n");
	else
		printf("Black\n");
	return 0;
}

#include<stdio.h>
int main()
{
		long long int n,x,y,w,b;
		scanf("%lld",&n);
		scanf("%lld",&x);
		scanf("%lld",&y);
		w=x+y-2;
		b=2*n-x-y;
		if((w<=b))
		{
				printf("White");
		}
		else{
				printf("Black");
			}
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int n;
	long long int x,y;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	long double d1,d2,dw,db ;
	d1 = d2 = dw = db = 0;
	d1=powl((x-1),2);
	d2=powl((y-1),2);
	dw=powl((d1+d2),0.5);

	d1 = d2 = 0;
	d1=powl((n-x),2);
	d2=powl((n-y),2);
	db=powl((d1+d2),0.5);

	if(dw>db)
		printf("Black");
	else
		printf("White");

	return 0;
}

#include<stdio.h>
int main(){
    long long int a,b,x,y,n;
     scanf("%I64d",&n);
     scanf("%I64d",&x);
     scanf("%I64d",&y);
     a=n+2;
     b=x+y;
     if(a<=b)
     {
        printf("BLACK");
     }
     else
     {
        printf("white");
     }

  return 0;
 }

#include <stdio.h>
#include<math.h>
int main()
{	long long int n,x,y;
    long double s,l;
	scanf("%I64d %I64d %I64d",&n,&x,&y);
	s=sqrtl(powl(x-1,2)+powl(y-1,2));
	l=sqrtl(powl(n-x,2)+powl(n-y,2));
	if(x==1 && y==1){
		printf("White");
		return 0;
	}
	else if(x==n && y==n){
		printf("Black");
		return 0;
	}
	else if(s<l){
		printf("White");
		return 0;
	}
	else if(l<s){
		printf("Black");
		return 0;
	}
	else if(s==l){
		printf("White");
		return 0;
	}
	return 0;
}

#include <stdio.h>
int main()
{
	long long int n,x,y,p,q;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	p=((x-1)+(y-1));
	q=((n-x)+(n-y));
	if (p>q)
	{
	 printf("black");
	}
	else
	{
	 printf("white");
	}
	return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX(x,y) ( x > y ? x : y )

typedef enum { Black, White } KingType;

static char *KingTypeStr[] =  { "Black", "White" };

static KingType Solve( unsigned long long n, unsigned long long x, unsigned long long y )
{
   unsigned long long distanceWhite = MAX ( x - 1, y - 1 );
   unsigned long long distanceBlack = MAX ( n - x, n - y );

   /* White wins if the distances are equal because white moves first.
      Hence <=  in the comparison below */

   if ( distanceWhite  <= distanceBlack ) return White;

   return Black;
}

static int RunSingleTest( unsigned long n, unsigned long x, unsigned long y, KingType expected )
{
   return ( Solve( n, x, y ) == expected );
}

static void RunTests()
{
   int testNum = 1;
   if(!RunSingleTest(4,2,3,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,3,5,Black)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(2,2,2,Black)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(2,2,2,Black)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,1,1,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,1,2,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,1,3,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,1,4,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,1,5,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(5,2,1,White)) printf("Test %d failed\n", testNum);  testNum++;
   if(!RunSingleTest(1000000000000000000ULL,1000000000000000000ULL,1000000000000000000ULL,Black)) printf("Test %d failed\n", testNum);  testNum++;
}

static void Abort( char *message )
{
   printf("%s\n", message );
   exit(1);
}

int main(int argc, char *argv[])
{
#define  LINE_LEN 256
    char line[LINE_LEN];
    unsigned long long n, x, y ;

    static char *oneIntFormat = "%I64d";
    static char *twoIntFormat = "%I64d %I64d";
    static char *incorrectValuesFormat = "Incorrect values of %I64d %I64d %I64d\n";;

    if( argc == 2 && !strcmp(argv[1],"-test"))
    {
       RunTests();
       exit(0);
    }

    if(!gets(line)) Abort("Cannot read first line");

    if(!sscanf( line, oneIntFormat, &n )) Abort("Cannot read integer from first line");

    if(!gets(line)) Abort("Cannot read second line");

    if(!sscanf( line, twoIntFormat, &x, &y )) Abort("Cannot read x y from second line");

    if (  n < 2 || x < 1 || y < 1 || x > n || y > n ) {
      sprintf( line, incorrectValuesFormat, n, x, y );
      Abort(line);
    }

    printf("%s\n", KingTypeStr[ Solve(n,x,y) ] );

    exit(0);

}

#include <stdio.h>
int main(){
    long long int n,x,y;
    scanf("%lli%lli%lli",&n,&x,&y);
  if(x+y<=n+1)
        printf("White");
    else
        printf("Black");
    return 0-0-0;
}

#include<stdio.h>

int main(){

    long long int r,c,n;

    scanf("%lld",&n);
    scanf("%lld",&r);
    scanf("%lld",&c);

   long long int a=r+c-2;
   long long int b=(2*n)-(r+c);

  if(a<=b){

	  printf("white");
  }

  else{

	  printf("black");
  }

  return 0;
}

#include<stdio.h>
int main()
{
    unsigned long long int n,x,y,a,b;
    scanf("%llu\n",&n);
    scanf("%llu\t%llu",&x,&y);
    a=(x-1)+(y-1);
    b=(n-x)+(n-y);
    if(a==b || a<b)
    {
        printf("White");
    }
    else
    {
        printf("Black");
    }
}

#include<stdio.h>
#include<math.h>

int main()
{
    unsigned long long  n, x, y, w, b, p, q;
	scanf("%llu", &n),
	scanf("%llu %llu", &x, &y);
	w=(x-1)+(y-1);
	b=(n-x)+(n-y);
	p=w;
	q=b;
	if(p==q || p<q)
	{
		printf("White");
	}
	else
	{
		printf("Black");
	}
}

#include<stdio.h>

int main()
{
    unsigned long long int x, y, n;
    unsigned long long int w,b;
    scanf("%I64d",&n);
    scanf("%I64d %I64d",&x, &y);
    w=((x-1)+(y-1));
    b=((n-x)+(n-y));
    if(w<=b)
        {printf("White");}
    else
        {printf("Black");}
    return 0;
}

#include<stdio.h>
#include<math.h>

int main()
{
	long long int n, x, y;

	scanf("%I64d", &n);
	scanf("%I64d %I64d", &x, &y);

	if((powl(powl(x-1,2) + powl(y-1,2), 0.5) <= powl(powl(x-n,2) + powl(y-n,2), 0.5))) {
			printf("White");
	}
	else {
		printf("Black");
	}

	return 0;

}

#include<stdio.h>
 int main()
 { long long int n,x,y,m,k;
    scanf("%lld",&n);
    scanf("%lld%lld",&x,&y);

    m=(x-1)+(y-1);
    k=(n-x)+(n-y);
    if(m>k)
    printf("black");
    else
    printf("white");

    return 0;
}

#include <stdio.h>

int main(void){
    long long n, x, y, temp1x, temp1y, temp2x, temp2y, max1, max2;
    scanf("%lli %lli %lli", &n ,&x, &y);
    temp1x=x-1;
    temp1y=y-1;
    temp2x=n-x;
    temp2y=n-y;
    if(temp1x>temp1y) max1=temp1x;
    else max1=temp1y;
    if(temp2x>temp2y) max2=temp2x;
    else max2=temp2y;
    if(max1<=max2) printf("White");
    else printf("Black");
    return 0;
}

#include<stdio.h>
int main()
{
	long long int n,x,y,cnt1=0,cnt2=0,a,b;

	scanf("%lld%lld%lld",&n,&x,&y);

	if (x-1>y-1) cnt1=x-1;
	else cnt1=y-1;

	if (n-x>n-y) cnt2=n-x;
	else cnt2=n-y;

	if (cnt1>cnt2) printf("Black");
	else printf("White");
}

#include<stdio.h>
int main(){
long long int n,a,b,x,y;
scanf("%I64d",&n);
scanf("%I64d%I64d",&a,&b);
if(a>=b){
    x=a-1;y=n-b;
    (x<=y)?printf("White"):printf("Black");
}
else{
    x=b-1;y=n-a;
(x<=y)?printf("White"):printf("Black");
}
return 0;}

#include<stdio.h>
int main()
{
   long long int n,x,y,r1,r2;
    scanf("%lld",&n);
    scanf("%lld%lld",&x,&y);
    r1=(x-1)+(y-1);
    r2=(n-x)+(n-y);

    if(r1>r2)
    {
        printf("Black");
    }
    if(r1<=r2)
    {
        printf("White");
    }
}

#include <stdio.h>

int main(){
	unsigned long long int size=0, x=0, y=0;
	scanf("%llu", &size);
	scanf("%llu %llu", &x, &y);

	if (((x-1)+(y-1))<((size-x)+(size-y))){
		printf("White");
	} else if (((x-1)+(y-1))>((size-x)+(size-y))){
		printf("Black");
	} else if (((x-1)+(y-1))==((size-x)+(size-y))){
		printf("White");
	}
}

#include<stdio.h>
#include <stdlib.h>
int main()
{
long long n,x,y,w=0,l=0;
scanf("%lld",&n);
scanf("%lld %lld",&x,&y);

w = (x-1)+(y-1);
l = (n-x)+(n-y);
if(w<=l)
printf("white\n");
else if(w>l)
printf("black\n");
}

#include<stdio.h>
int main()
{
 unsigned long long  n,x,y,b,w;
scanf("%llu %llu %llu",&n,&x,&y);
 b=(n-x)+(n-y);
 w=(x-1)+(y-1);
 if(w>b)
 printf("black");
 else
 printf("white");
 }

# include<stdio.h>

int main()
{
	long long int n,x,y,a,b;
	scanf("%I64d",&n);
	scanf("%I64d%I64d",&x,&y);
	a=(x-1)+(y-1);
	b=(n-y)+(n-x);
	if(a<=b)
		printf("White\n");
	else
		printf("Black\n");
	return 0;
}

#include<stdio.h>
int main(){
	long long n, x, y, dw, db;
	scanf("%lld%lld%lld", &n, &x, &y);
	dw = x - 1 + y - 1;
	db = n - x + n - y;
	if (db < dw) printf("Black");
	else printf("White");
	return 0;
}

#include<stdio.h>
int main()
{
    unsigned long long  n,x,y,b,w;
    scanf("%llu %llu %llu",&n,&x,&y);
    b=(n-x)+(n-y);
    w=(x-1)+(y-1);
    if(w>b)
        printf("black");
    else
        printf("white");
}

#include <stdio.h>
#include<math.h>
int main()
{
	long long int a, b, c,  n, o;
	scanf("%I64D",&a);
	scanf("%I64D %I64D ",&b,  &c);
	n = ((2*a) -(b+c));
	o = ((b+c)-2);

	if (n<o)
		printf("black");
	else
		printf("white");
	return 0;
}

/*
 * kings race.c
 *
 * Copyright 2019  <examuser@14CPU0017L>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>

int main()
{
	long long int x,y,n,w,b;
	scanf("%I64d",&n);
	scanf("%I64d",&x);
	scanf("%I64d",&y);
	w=(x-1)+(y-1);
	b=(n-x)+(n-y);
	if(w<=b)
	   printf("white");
	   else
	   printf("black");

	return 0;
}

#include <stdio.h>

int main() {
	long long n;scanf("%I64d",&n);long long x,y;
	scanf("%I64d%I64d",&x,&y);
	 if(x+y<=n+1){
	    printf("%s","White");
	}
	else if(x+y>=n+2){
	    printf("%s","Black");
	}
		return 0;
}

#include<stdio.h>
#include<math.h>
 int main() {
	unsigned long long n,x,y;
	scanf("%llu",&n);
	scanf("%llu %llu",&x,&y);
if((x+y)<(n+2)) {printf("white");}
	else {printf("black");}
return 0;
}

#include<stdio.h>
#include<inttypes.h>
int main()
{
long long int n;
scanf("%I64d",&n);

long long int x,y;
scanf("%I64d %I64d",&x,&y);

long long int nblack,nwhite;

 long long int s=x<y?x:y;
 long long int g=x>y?x:y;

nwhite=s-1+g-s;

nblack=n-g+g-s;

if(nwhite<=nblack){printf("white");}
else{printf("black");}

return 0;
}

#include <stdio.h>

int main()
{
	long long n, x, y;
	scanf("%I64d%I64d%I64d", &n, &x, &y);

	if (x + y > n + 1) {
		printf("Black");
	} else {
		printf("White");
	}
}

#include<stdio.h>

int main()
{
    unsigned long long int x, y, n;
    unsigned long long int w,b;
    scanf("%I64d",&n);
    scanf("%I64d %I64d",&x, &y);
    w=((x-1)+(y-1));
    b=((n-x)+(n-y));
    if(w<=b)
        {printf("White");}
    else
        {printf("Black");}
    return 0;
}

/*
 * kings.c
 *
 * Copyright 2019 Koushik <koushik@Koushik>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>

int main(int argc, char **argv)
{
			long long int w,b,a,x,y;
			scanf("%I64d",&a);
			scanf("%I64d %I64d",&x,&y);
			w=((x+y)-2);
			b=((2*a)-(x+y));
			if (w<=b)
				printf("White");
			else
				printf("Black");
	return 0;
}

/*
 * kingrace.c
 *
 * Copyright 2019  <examuser@11cpu0143L>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>

int main(int argc, char **argv)
{
  long long n,x,y, w,b;
  scanf("%lld",&n);
  scanf("%lld",&x);
  scanf("%lld",&y);
  w=(x-1)+(y-1);
  b=(n-x)+(n-y);
  if(w<=b)
    printf("white\n");
  else
    printf("black\n");
    return 0;
}

#include<stdio.h>
int main()
{
	long long int n,x,y,k,s;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);

	s=((x-1)+(y-1));
	k=((n-x)+(n-y));

	if (s>k)
	{
		printf("BLACK");
	}
	else
	{
		printf("WHITE");
	}
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long n,x,y,s1,s2;
	scanf("%I64d",&n);
	scanf("%I64d",&x);
	scanf("%I64d",&y);
	s1=x+y-2;
	s2=2*n-x-y;
	if(s1>s2)
	{
		printf("Black\n");
	}
	else
	{
		printf("White\n");
	}
	return 0;
}

/*
 * king.c
 *
 * Copyright 2019  <examuser@11cpu0143L>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>
#include <math.h>
int main(int argc, char **argv)
{
  int n,x,y,w,b;
  scanf("%d",&n);
  scanf("%d",&x);
  scanf("%d",&y);
  w=sqrt(pow((x-1),2)+pow((y-1),2));
  b=sqrt(pow((n-x),2)+pow((n-y),2));
  if(w<=b)
    printf("white");
  else
    printf("black");
  return 0;
}

#include<stdio.h>
#include<math.h>

int main()
{
	long int n, x, y;

	scanf("%ld", &n);
	scanf("%ld %ld", &x, &y);

	if((pow(pow(x-1,2) + pow(y-1,2), 0.5) <= pow(pow(x-n,2) + pow(y-n,2), 0.5)))
			printf("White");

	else
		printf("Black");

	return 0;

}

#include <stdio.h>
#include <math.h>
int main(){
	long long int n,c1,c2;
	long double bk,bx,by,wk,wx,wy;
	scanf("%I64d",&n);
	scanf("%I64d",&c1);
	scanf("%I64d",&c2);

	bx=c1-n;
	bx= powl((bx),2);
	by=c2-n;
	by=powl((by),2);
	bk=sqrt(bx+by);

	wx=c1-1;
	wx= powl((wx),2);
	wy=c2-1;
	wy=powl((wy),2);
	wk=sqrt(wx+wy);

	if(wk<=bk){
		printf("White");
    }else{
		printf("Black");
	}
	return 0;
}

#include <stdio.h>

int main() {
	int n,x,y;
	scanf("%d",&n);
	scanf("%d %d",&x,&y);
if((x+y)<(n+2)) {printf("white");}
	else {printf("black");}
return 0;
}

#include<stdio.h>
int main(){
long long int n,a,b;
scanf("%l64d%l64d%l64d", &n,&a,&b);
if((a+b)>=(n+2)){
printf("Black");
}
else{
printf("White");
}
}

#include<stdio.h>

int main()
{
   long long int n,x,y;
    long long int a,b;
    scanf("I64d",&n);
    scanf("%I64d%I64d",&a,&b);
    a=((x-1)*(x-1))+((y-1)*(y-1));
    b=((n-x)*(n-x))+((y-n)*(y-n));
    if(a>b)
    {
        printf("black");
    }
    else
    {
        printf("white");
    }
}

#include<stdio.h>
#include<math.h>
int main()
{
   long long int n,x,y,w,b;
   scanf("%lld %lld %lld",&n,&x,&y);
   w=(x-1)+(y-1);
   b=(n-x)+(n-y);
   if(w<b)
   {
       printf("white");
   }
   else{
    printf("black");
   }
}

main()
{
    int n;
    int x,y;
    scanf("%d",&n);
    scanf("%d%d",&x,&y);
    int white,white1,white2,black,black1,black2;

        white1=(x-1)+(x-y);
        white2=(y-1)+(x-y);
        white=white1+white2;

        black1=(n-x)+(x-y);
        black2=(n-y)+(x-y);
        black=black1+black2;

    if(black<white)
    {
        printf("Black");
    }
    else if(black==white)
        {
            printf("White");
        }
        else
        {
            printf("White");
        }
}

#include<stdio.h>
main()
{
    long int n,x,y,i,j;
    scanf("%ld%ld%ld",&n,&x,&y);
    if(x<=y)
    {
        i=y-1;
        j=n-x;
    }
    else if(x>y)
    {
        i=x-1;
        j=n-y;
    }
    if(j>=i)
    {
        printf("White");
    }
    else
    {
        printf("Black");
    }
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int a,b,c,n,o;
	scanf("%I64lld",&a);
	scanf("%I64lld %I64lld",&a,&b);
	n=((2*a)-(b+c));
	o=((b+c)-2);
	if(n<o)
	printf("black");
	else
	printf("white");
	return 0;
}

#include<stdio.h>
#include<math.h>
 int main()
{
 unsigned long int n,x,y,w1,w2,b1,b2;
 double w,b;
 scanf("%ld",&n);
 scanf("%ld%ld",&x,&y);
 w1=w2=1;
 b1=b2=n;
 w=sqrt((x-w1)*(x-w1)+(y-w2)*(y-w2));
 b=sqrt((x-b1)*(x-b1)+(y-b2)*(y-b2));
 if(w<=b)
 printf("White");
 else
 printf("Black");
 return 0;
}

#include<stdio.h>
int main()
{
long long int n,a,b;
scanf("%l64d %l64d %l64d", &n,&a,&b);
if(a+b>=n+2)
{
printf("Black");
}
else
{
printf("White");
}
}

#include<stdio.h>
int main()
{
int n,x,y,w,l;
scanf("%d",&n);
scanf("%d %d",&x,&y);

w = (x-1)+(y-1);
l = (n-x) + (n-y);
if(w<=l)
printf("white\n");
else if(w>=l)
printf("black\n");
}

#include<stdio.h>
int main(){
    long long unsigned int x,y,n,a,b;
    scanf("%d",&n);
    scanf("%I64ud %I64ud",&x,&y);
    a=(x-1)*(x-1)+(y-1)*(y-1);
    b=(n-x)*(n-x)+(n-y)*(n-y);
    if(a>b){
        printf("Black");
    }
    else if(a=b){
        printf("White");
    }
    else{
        printf("White");
    }
}

#include <stdio.h>

int main() {
	long long int n;
	int x,y,i,d,k=0;
	scanf("%lld",&n);
	scanf ("%d%d",&x,&y);
	d=abs(x-(n+1));
	for(i=1;i<=d;i++)
	{
	    if(y==i)
	    {
	        k=1;
	        printf("White");
	}
	}
	if(k!=1)
	printf("black");

	return 0;
}

#include<stdio.h>
int main()
{
		int n,x,y,w,b;
		scanf("%d",&n);
		scanf("%d",&x);
		scanf("%d",&y);
		w=(x+y)-2;
		b=(n-x)+(n-y);
		if((w<b)||(w==b))
		{
				printf("White");
		}
		else{
				printf("Black");
			}
	return 0;
}

#include<stdio.h>
int main()
{
	long long int n,x,y;
	scanf("%d",&n);
	scanf("%d",&x);
	scanf("%d",&y);
	if(x+y<=(1+n))
	printf("White");
	else
	printf("Black");
	return 0;
}

#include<stdio.h>
int main(){
    long long int x,y,n;
    long long int a,b;
    scanf("%I64d",&n);
    scanf("%I64d %I64d",&x,&y);
    a=(x-1)*(x-1)+(y-1)*(y-1);
    b=(n-x)*(n-x)+(n-y)*(n-y);
    if(a>b){
        printf("Black");
    }
    else if(a==b){
        printf("White");
    }
    else{
        printf("White");
    }
}

#include <stdio.h>

int main(int argc, char **argv)
{
	long long int n,x,y;
	unsigned long int a,b;
	scanf("%I64d\n",&n);
	scanf("%I64d\t%I64d",&x,&y);
	a=((x-1)+(y-1));
	b=((n-x)+(n-y));
	if(a<=b)
	{
	    printf("White");
	}
	else
	{
	    printf("Black");
	}
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
	unsigned long long int n,x,y,w,b;
	scanf("%llu",&n);
	scanf("%llu%llu",&x,&y);
	//w=x+y-2;
	//b=(unsigned long long int)abs(x+y-n-n);
	/*if(w<=b)
	printf("White\n");
	else
	printf("Black\n");
	return 0;*/
	if(y>x)
	{
		w=y-1;
		b=n-y;
	}
	else if(x>y)
	{
		w=x-1;
		b=n-x;
	}
	else
	{
		if(n%2!=0)
		{
			w=x;
			b=x;
		}
		else
		{
			w=x;
			b=n-x;

		}
	}
	if(w<=b)
	printf("White\n");
	else
	printf("Black\n");
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
long double n,x,y;
scanf("%Lf",&n);
scanf("%Lf %Lf",&x,&y);
if(sqrt(powl(1-x,2)+powl(1-y,2))<=sqrt(powl(n-x,2)+powl(n-y,2)))
printf("White");
else
printf("Black");
return 0;
}

#include<stdio.h>
#include<math.h>

int main()
{
    unsigned long long  n, x, y, w, b, p, q;
	scanf("%llu", &n),
	scanf("%llu %llu", &x, &y);
	w=((x-1)*(x-1)+(y-1)*(y-1));
	b=((n-x)*(n-x)+(n-y)*(n-y));
	p=sqrt(w);
	q=sqrt(b);
	if(p==q || p<q)
	{
		printf("White");
	}
	else
	{
		printf("Black");
	}
}

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main(){
     long int n ,x,y;
     scanf("%ld", &n);
    scanf("%ld  %ld", &x, &y);
    if ( (n-x) + (n-y) < (x-1) + (y-1) )
    printf("Black");
    else
    printf("White");

}

#include <stdio.h>
#include <math.h>
int main()
{
	long long n,x,y,a,b;
	double d1,d2;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	a=(x-1)*(x-1) + (y-1)*(y-1);
	b=(n-x)*(n-x) + (n-y)*(n-y);
	d1=pow(a,0.5);
	d2=pow(b,0.5);
	if(d1<=d2)
	{
		printf("White");
		}
	if(d1>d2)
	{
		printf("Black");
		}
	return 0;
}

/*
 * break.c
 *
 * Copyright 2019 Koushik <koushik@Koushik>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>
#include<math.h>

int main()
{
	int a, b, c, k, m;
	scanf("%d",&a);
	scanf("%d %d",&b, &c);
	k = (b - a) *  (b - a) + (c - a ) * (c - a);
	m = (b - 1) * (b - 1) + (c - 1) * (c - 1);
	if (sqrt(k) < sqrt(m))
		printf("Black");
	else
		printf("White");
	return 0;
}

#include<stdio.h>
int main(){
	int n, x, y, dw, db;
	scanf("%d%d%d", &n, &x, &y);
	dw = abs(1-x)+abs(1-y);
	db = abs(n-x) + abs(n-y);
	if (db < dw) printf("Black");
	else printf("White");
	return 0;
}

#include<stdio.h>
long long int max(long long int a,long long int b)
{
 if(a>b)
	 return a;
 else
	 return b;
}
int main(void)
{
  int n;
  scanf("%d",&n);
  int x,y;
  scanf("%d %d",&x,&y);
  int d1,d2;
  d1=max(x-1,y-1);
  d2=max(n-x,n-y);
  if(d1>d2)
	  printf("black\n");
  else
	  printf("white\n");
}

#include<stdio.h>
#include<math.h>
int main()
{
    long long int x, y, n;
    long long int d1, d2;
    scanf("%I64d",&n);
    scanf("%I64d %I64d",&x, &y);
    d1=sqrtl((x-1)*(x-1)+(y-1)*(y-1));
    d2=sqrtl((x-n)*(x-n)+(y-n)*(y-n));
    if(d1<=d2)
        {printf("WHITE");}
    else
        {printf("BLACK");}
    return 0;
}

#include <stdio.h>
#include <math.h>

int distance(int x ,int  y ,int x0 ,int y0){
    return sqrt(pow(x0-x,2)+pow(y0-y,2));
}

int main()
{
    int n , x , y , x1=1 , y1=1 , wd , bd ;
    scanf("%d",&n);
    scanf("%d%d",&x,&y);
    wd = distance(x , y , x1 , y1);
    bd = distance(x , y , n , n);
    if(wd == bd){
        printf("White");
    }
    else if(x == 1 && y ==1){
        printf("White");
    }
    else{
        printf("Black");
    }

}

#include<stdio.h>
int main ()
{
	int a,n,x,y,l;
	unsigned s;
	scanf("%d",&n);
	scanf ("%d %d",&x,&y);
;
	if (s>l){
		printf("black\n");
	}
	else if (l>s){
		printf("white\n");
	}
	return 0;
}

#include <stdio.h>
#include <math.h>

double hyp (int a, int b){
    return sqrt(a*a + b*b);
}

int main(void) {
	int size=0, x=0, y=0;
	scanf("%d", &size);
	scanf("%d %d", &x, &y);

	if (hyp(x-1, y-1) < hyp(size-x, size-y)){
		printf("White");
	} else if (hyp(x-1, y-1) > hyp(size-x, size-y)){
		printf("Black");
	} else if (hyp(x-1, y-1) == hyp(size-x, size-y)){
		printf("White");
	}

	return 0;
}

#include <stdio.h>
#include <string.h>

int main(){
    int n , x , y ;
    scanf("%d",&n);
    scanf("%d%d",&x,&y);
    if(x+y <= n+1)
        printf("White");
    else
    {
        printf("Black");
    }

}

#include<stdio.h>

int main()
{
	int i,n,r,c;
	scanf("%d",&n);
	scanf("%d %d",&r,&c);
	if((r+c)<=(n+1))
	{
		printf("White\n");
	}
	else
		printf("Black\n");
	return 0;
}

# include <stdio.h>

int main(void) {
	int n, x, y;
	scanf("%d", &n);
	scanf("%d", &x);
	scanf("%d", &y);
	if (y <= -1*(x-1)+n) {
		printf("White\n");
	}
	else {
		printf("Black\n");
	}
	return 0;
}

// 1075 A - Chess

#include<stdio.h>
#include<math.h>

int main()
{
	long long int n, x, y;

	scanf("%I64d", &n);
	scanf("%I64d %I64d", &x, &y);

	if((pow(pow(x-1,2) + pow(y-1,2), 0.5) <= pow(pow(x-n,2) + pow(y-n,2), 0.5))) {
			printf("White");
	}
	else {
		printf("Black");
	}

	return 0;

}

# include <stdio.h>

int main(void) {
	int n, x, y;
	scanf("%d", &n);
	scanf("%d", &x);
	scanf("%d", &y);
	if (x==y & x==n) {
		printf("Black\n");
	}
	else if (y <= -1*(x-1)+n) {
		printf("White\n");
	}
	else {
		printf("Black\n");
	}
	return 0;
}

/*
 * king.c
 *
 * Copyright 2019  <examuser@10CPU0064L>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>
#include<math.h>
int main(int argc, char **argv)
{
	long int n,a,l,w,b;
	w=0;
	scanf("%ld",&n);
	scanf("%ld %ld",&a,&b);
	w=(a-1)+(b-1);
	l=(n-a)+(n-b);
	if(w<=l)
	{
		printf("white");
	}
	else
	{
		printf("black");
	}
	return 0;
}

#include<stdio.h>
#include<math.h>
int main()
{
long long int n,x,y;
long double d1,d2;
d1=d2=0;
scanf("%I64d",&n);
scanf("%I64d %I64d",&x,&y);
d1=sqrt(powl(1-x,2)+powl(1-y,2));
d2=sqrt(powl(n-x,2)+powl(n-y,2));
if(d1<=d2)
printf("White");
else
printf("Black");
return 0;
}

#include<stdio.h>
int main()
{
    int x,y,n,s,t,a,b,p,q,c;
    scanf("%d",&n);
    scanf("%d%d",&x,&y);
    a=x-1;
    b=y-1;
    p=n-x;
    q=n-y;
    if(a>b){
        c=b;
        s=c+a-b;
    }
    else if(b>a){
        c=a;
        s=c+b-a;
    }
    else{
        c=a;
        s=a;
    }
    if(p>q){
        c=q;
        t=c+p-q;
    }
    else if(q>p){
        c=p;
        t=c+q-p;
    }
    else{
        c=a;
        t=a;
    }
    if(s<=t){
        printf("White");
    }
    else{
        printf("Black");
    }

}

#include<stdio.h>

int main()
{
   long long int n,x,y;
    long long int a,b;
    scanf("I64d",&n);
    scanf("%I64d%I64d",&a,&b);
    a=((x-1)*(x-1))+((y-1)*(y-1));
    b=((n-x)*(n-x))+((y-n)*(y-n));
    if(a>b)
    {
        printf("black");
    }
    else
    {
        printf("white");
    }
}

#include<stdio.h>
int main()
{
    long long int n,a,b,x,y;
    scanf("%I64d%I64d%I64d",&n,&a,&b);

    x=(1-a)*(1-a)+(1-b)*(1-b);
    y=(n-a)*(n-a)+(n-b)*(n-b);
    if(x<=y)
        printf("White\n");
    else
        printf("Black\n");
    return 0;
}

#include <stdio.h>
#include <math.h>
int main(){
	double n,bk,bx,by,wk,wx,wy,c1,c2;
	scanf("%lf",&n);
	scanf("%lf",&c1);
	scanf("%lf",&c2);

	bx=c1-n;
	bx= pow((bx),2);
	by=c2-n;
	by=pow((by),2);
	bk=sqrt(bx+by);

	wx=c1-1;
	wx= pow((wx),2);
	wy=c2-1;
	wy=pow((wy),2);
	wk=sqrt(wx+wy);

	if(wk<=bk){
		printf("White");
    }else{
		printf("Black");
	}
	return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int x,y,n,wdis,bdis;
	scanf("%I64d",&n);
	scanf("%I64d",&x,&y);
	wdis=(x-1)+(y-1);
	bdis=(n-x)+(n-y);
	if(wdis<=bdis)
	    printf("White");
	 else
	    printf("Black");
	return 0;
}

#include<stdio.h>

int main()
{
   long long int n,x,y;
    long long int a,b;
    a=((x-1)*(x-1))+((y-1)*(y-1));
    b=((n-x)*(n-x))+((y-n)*(y-n));
    if(a>b)
    {
        printf("BLACK");
    }
    else
    {
        printf("WHITE");
    }
}

#include<stdio.h>
#include<math.h>
 int main()
{
 long long int n,x,y,w1,w2,b1,b2,w,b;
 scanf("%lld",&n);
 scanf("%lld%lld",&x,&y);
 w1=w2=1;
 b1=b2=n;
 w=sqrt((x-w1)*(x-w1)+(y-w2)*(y-w2));
 b=sqrt((x-b1)*(x-b1)+(y-b2)*(y-b2));
 if(w<=b)
 printf("White");
 else
 printf("Black");
 return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long n,x,y,a,b;
	double d1,d2;
	scanf("%I64d\n %I64d %I64d",&n,&x,&y);
	a=(x-1)*(x-1) + (y-1)*(y-1);
	b=(n-x)*(n-x) + (n-y)*(n-y);
	d1=pow(a,0.5);
	d2=pow(b,0.5);
	if(d1<=d2)
	{
		printf("WHITE");
		}
	if(d1>d2)
	{
		printf("BLACK");
		}
	return 0;
}

#include<stdio.h>

int main(){
	int n,x,y;
	scanf("%d %d %d", &n,&x,&y);
	int wt ,bl, count =0;
	if(x==n&&y==n){
		printf("Black\n");
		return 0;
	}else if(x==1&& y==1){
		printf("White\n");
		return 0;
	}
	else{
		wt = (x-1)>(y-1)?(x-1):(y-1) ;
		bl = (n-x+1)>(n-y+1)?(n-x+1):(n-y+1)+1;
//		printf("%d %d", wt,bl);
	}
	if(wt < bl){
		printf("White\n" );
	}else
		printf("Black\n");
}

/*
 * kings.c
 *
 * Copyright 2019 Koushik <koushik@Koushik>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>

int main(int argc, char **argv)
{
			long long int w,b,a,x,y;
			scanf("%I64d",&a);
			scanf("%I64d%I64d",&x,&y);
			w=((x+y)-2);
			b=((2*a)-(x+y));
			if (w>b)
			printf("White");
			else
			printf("Black");
	return 0;
}

#include<math.h>
 int main()
{
 long long n,x,y,w1,w2,b1,b2,w,b;
 scanf("%d",&n);
 scanf("%d%d",&x,&y);
 w1=w2=1;
 b1=b2=n;
 w=pow((x-w1),2)+pow((y-w2),2);
 b=pow((x-b1),2)+pow((y-b2),2);
 if(w>=b)
 printf("White");
 else
 printf("Black");
 return 0;
}

#include<stdio.h>
int maxium(int x,int y)
{	if(x>y)
	return x;
}
int mini(int x,int y)
{ if(x<y)
	return y;
}
int main()
{	int x,y,n,a,b;
	scanf("%d",&n);
	scanf("%d %d",&x,&y);
	a=maxium(x,y)-1;
	b=n-mini(x,y);
	if(a<=b)
	printf("WHITE");
	else
	printf("BLACK");
	return 0;
	}

#include<stdio.h>
#include<math.h>
int main()
{
    long long x,y,n;
    scanf("%lld%lld%lld",&n,&x,&y);
    double a,b;
    a=sqrt((x-1)*(x-1) +(y-1)*(y-1));
    b=sqrt((n-x)*(n-x)+(n-y)*(n-y));
    if(a<=b)
    printf("\nWhite");
    else
    printf("\nBlack");
    return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int a,b,c,n,o;
	scanf("%I64lld",&a);
	scanf("%I64lld %I64lld",&a,&b);
	n=((2*a)-(b+c));
	o=((b+c)-2);
	if(n<o)
	printf("black");
	else
	printf("white");
	return 0;
}

/*
 * kings race.c
 *
 * Copyright 2019  <examuser@14CPU0017L>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>

int main(int argc, char **argv)
{
	int x,y,n,w,b;
	printf("enter the value of n");
	scanf("%d",&n);
	scanf("%d",&x);
	scanf("%d",&y);
	w=(x-1)+(y-1);
	b=(n-x)+(n-y);
	if(w<=b)
	   printf("white");
	   else
	   printf("black");

	return 0;
}

#include<stdio.h>
int main(){
long long int n,x,y;
scanf("%lld",&n);
long long int wx=1,wy=1,bx=n,by=n;
scanf("%lld%lld",&x,&y);
if(((x-wx+1<-(x-bx) && y-wx<-(y-bx) )|| (x-wx+1<-(x-bx) && y-wx>-(y-bx) ))||((x-wx<-(x-bx) && y-wx+1<-(y-bx))||(x-wx<-(x-bx) && y-wx+1>-(y-bx)) )||(( x-wx+1<-(x-bx) && y-wx+1<-(y-bx) )||( x-wx+1<-(x-bx) && y-wx+1>-(y-bx) )))
        printf("White");
else
        printf("Black");

return 0;
}

#include <stdio.h>

int main(int argc, char **argv)
{
	long long int n,x,y,p=0,q=0;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	p=((1-x)*(1-x)+(1-y)*(1-y));
	q=((n-x)*(n-x)+(n-y)*(n-y));
	if (p>q)
	 printf("black");
	else
	 printf("white");

	return 0;
}

#include<stdio.h>
int main()
{
  int n,x,y,w,b;
  scanf("%d",&n);
  scanf("%d",&x);
  scanf("%d",&y);
  w=sqrt(pow((x-1),2)+pow((y-1),2));
  b=sqrt(pow((n-x),2)+pow((n-y),2));
  if(w<=b)
    printf("white");
  else
    printf("black");
  return 0;
}

#include <stdio.h>

int main(int argc, char **argv)
{
	int n,x,y,p=0,q=0;
	scanf("%d",&n);
	scanf("%d %d",&x,&y);
	p=((1-x)*(1-x)+(1-y)*(1-y));
	q=((n-x)*(n-x)+(n-y)*(n-y));
	if (p>q)
	 printf("black");
	else
	 printf("white");

	return 0;
}

/*
 * kin.c
 *
 * Copyright 2019  <examuser@11cpu0062L>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 *
 */

#include <stdio.h>

int main(int argc, char **argv)
{
	long long n,x,y,w,b;
	scanf("%lld %lld %lld",&n,&x,&y);
	w= ((x-1)+(y-1));
	b=((x-n)+(y-n));
	if(w>=b)
	printf("white");
	else
	printf("black");

	return 0;
}

#include <stdio.h>
int main()
{
	long long int n,x,y,p,q;
	scanf("%I64dd",&n);
	scanf("%I64d %I64d",&x,&y);
	p=((x-1)+(y-1));
	q=((n-x)+(y-n));
	if (p<=q)
	{
	 printf("white");
	}
	else
	{
	 printf("black");
	}
	return 0;
}

#include<stdio.h>
main()
{
    long long n,a,b;
    scanf("%ld%ld%ld",&n,&a,&b);
    if(a+b<=n+1)
    printf("White");
    else
    printf("Black");
}

#include<stdio.h>
int main()
{
	long long int n,x,y;
	scanf("%d",&n);
	scanf("%d",&x);
	scanf("%d",&y);
	if(x+y<=1+n)
	printf("White");
	else
	printf("Black");
	return 0;
}

#include<stdio.h>
int main(){
long long int a,b,n;
scanf("%l64d %l64d %l64d", &n, &a, &b);
if ((a+b)>=(n+2))
	printf("Black\n");
else
	printf("White\n");
return 0;
}

#include<stdio.h>
int main()
{
long long int n,a,b;
scanf("%l64d %l64d %l64d", &n,&a,&b);
if(a+b>=n+2)
{
printf("Black\n");
}
else
{
printf("White\n");
}
}

#include<stdio.h>
int main()
{
    unsigned long long int n,a,b,x,y;
    scanf("%I64u%I64u%I64u",&n,&a,&b);

    x=(1-a)*(1-a)+(1-b)*(1-b);
    y=(n-a)*(n-a)+(n-b)*(n-b);
    if(x<=y)
        printf("White\n");
    else
        printf("Black\n");
    return 0;
}

#include <stdio.h>

 int main() {
	unsigned long n,x,y;
	scanf("%lu",&n);
	scanf("%lu %lu",&x,&y);
if((x+y)<(n+2)) {printf("white");}
	else {printf("black");}
return 0;
}

#include<stdio.h>
int main(){
    long long int n,x,y,j;
    scanf("%lld",&n);
    scanf("%lld",&x,&y);
    j=x-y;
    if(j<0)
    j*=-1;
    if(j%2==0)
    printf("Black");
    else
    printf("White");

    return 0;

}

#include<stdio.h>
int main()
{
 long long int n,min1,min2,x,y;
	scanf("%I64d",&n);
	scanf("%l64d %I64d",&x,&y);
	if(x>y)
	{
 min1=n-x;
 min2=y-1;
 }
	else
	{
		min1=n-y;
		min2=x-1;
	}

	if(min1<min2)
	{
		printf("Black");
	}
else{
		printf("White");
	}
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int n,x,y,a,b;
	double d1,d2;
	scanf("%I64d",&n);
	scanf("%I64d %I64d",&x,&y);
	a=(x-1)*(x-1) + (y-1)*(y-1);
	b=(n-x)*(n-x) + (n-y)*(n-y);
	d1=pow(a,0.5);
	d2=pow(b,0.5);
	if(d1<=d2)
	{
		printf("White");
		}
	if(d1>d2)
	{
		printf("Black");
		}
	return 0;
}

#include<stdio.h>
int main()
{
		int n,x,y;
		scanf("%d",&n);
		scanf("%d",&x);
		scanf("%d",&y);
		if((x%2!=0)&&(y%2!=0)&&(x==y))
		{
		        printf("white");
		}
		else{
		        printf("black");
		}

		while(x!=y)
		{
		if(x%2==0&&y%2!=0)
		{
				printf("white");break;
		}
		else if(x%2!=0&&y%2!=0)
		{
						printf("black");break;
		}
		else if(x%2==0&&y%2==0)
		{
				printf("black");break;
		}
		else{
				printf("white");break;
		}
    }
}

#include<stdio.h>
#include<math.h>

int main()
{
	int n;
	int x,y;
	scanf("%d",&n);
	scanf("%d %d",&x,&y);
	int dw1,dw2 ;
	float distw,distb;
	dw1 = dw2 = distw = distb = 0;
	dw1=pow((x-1),2);
	dw2=pow((y-1),2);
	distw=pow((dw1+dw2),0.5);
	dw1=pow((n-x),2);
	dw2=pow((n-y),2);
	distb=pow((dw1+dw2),0.5);
	if(distw>distb)
		printf("Black");
	else
		printf("White");

	return 0;
}

#include <stdio.h>

int main() {
	long long n;scanf("%I64d",&n);long long x,y;
	scanf("%I64d%I64d",&x,&y);
	if(x==n&&y==n){
	    printf("%s","Black");
	}
	if(x==1&&y==1){
	    printf("%s","White");
	}
	if(x+y<=n+1){
	    printf("%s","White");
	}
	if(x+y>=n+2){
	    printf("%s","Black");
	}
		return 0;
}

#include<stdio.h>
main()
{
    int n,a,b;
    scanf("%d%d%d",&n,&a,&b);
    if(a+b<=n+1)
    printf("White");
    else
    printf("Black");
}

#include<stdio.h>
#include<math.h>
int main()
{
	long long int n,x,y,w,b;
	scanf("%lld",&n);
	scanf("%lld%lld",&x,&y);
	w=x+y-2;
	b=(long long int)abs(x+y-n-n);
	if(w<=b)
	printf("White\n");
	else
	printf("Black\n");
	return 0;
}

#include<stdio.h>
int main(){
long long int a,b,n;
scanf("%l64d %l64d %l64d", &n, &a, &b);
if ((a+b)>=(n+2))
	printf("White\n");
else
	printf("Black\n");
return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long n,x,y,a,b;
	double d1,d2;
	scanf("%I64d\n %I64d %I64d",&n,&x,&y);
	a=(x-1)*(x-1) + (y-1)*(y-1);
	b=(n-x)*(n-x) + (n-y)*(n-y);
	d1=pow(a,0.5);
	d2=pow(b,0.5);
	if(d1<=d2)
	{
		printf("White");
		}
	if(d1>d2)
	{
		printf("Black");
		}
	return 0;
}

#include<stdio.h>
int main(){
	int n, x, y, dw, db;
	scanf("%d%d%d", &n, &x, &y);
	dw = abs(1-x)+abs(1-y);
	db = abs(n-x) + abs(n-y);
	if (dw < dw) printf("Black");
	else printf("White");
	return 0;
}

# include <stdio.h>

int main(void) {
	int n, x, y;
	scanf("%d", &n);
	scanf("%d", &x);
	scanf("%d", &y);
	if (x==y & x==n) {
		printf("Black\n");
	}
	else if (y <= -1*(x-1)+n) {
		printf("White\n");
	}
	else {
		printf("Black\n");
	}
	return 0;
}

#include<stdio.h>
#include<math.h>
 int main()
{
 long long n,x,y,w1,w2,b1,b2,w,b;
 scanf("%d",&n);
 scanf("%d%d",&x,&y);
 w1=w2=1;
 b1=b2=n;
 w=pow((x-w1),2)+pow((y-w2),2);
 b=pow((x-b1),2)+pow((y-b2),2);
 if(w>=b)
 printf("White");
 else
 printf("Black");
 return 0;
}

#include<stdio.h>
#include<math.h>

int main()
{
	float n, x, y, w, b, p, q;
	scanf("%f", &n),
	scanf("%f %f", &x, &y);
	w=((x-1)*(x-1)+(y-1)*(y-1));
	b=((n-x)*(n-x)+(n-y)*(n-y));
	p=sqrt(w);
	q=sqrt(b);
	if(p==q || p<q)
	{
		printf("White");
	}
	else
	{
		printf("Black");
	}
}

#include <stdio.h>
#include <math.h>
int main()
{
	int n,a,b,c,d,x,y;
	float r1,r2,r3,r4,f,h,j,k,l;
	l=0.5;
	scanf("%d\n",&n);
	scanf("%d %d",&x,&y);
	a=1,b=1,c=n,d=n;
	f=x-1,h=y-1,j=n-x,k=n-y;
	r1=pow(f,2)+pow(h,2);
	r2=pow(j,2)+pow(k,2);
	r3=pow(r1,l);
	r4=pow(r2,l);
	if(r3==r4){
	printf("White");
	}
	else if(r3<r4){
	printf("white");
	}
	else if(r3>r4){
	printf("Black");
	}
	return 0;
}

#include<stdio.h>

int main()
{
   long long  n,x,y;
    int a,b;
    a=((x-1)*(x-1))+((y-1)*(y-1));
    b=((n-x)*(n-x))+((y-n)*(y-n));
    if(a>b)
    {
        printf("white");
    }
    else
    {
        printf("black");
    }
}

#include<stdio.h>
#include<math.h>
int main()
{
    unsigned long long int x, y, n;
    unsigned long long int d1, d2;
    scanf("%I64d",&n);
    scanf("%I64d %I64d",&x, &y);
    d1=((x-1)*(x-1)+(y-1)*(y-1));
    d2=((x-n)*(x-n)+(y-n)*(y-n));
    if(d1<=d2)
        {printf("White");}
    else
        {printf("Black");}
    return 0;
}

#include<stdio.h>
int main()
{
    long long int x,y,n;
    unsigned int a,b;
    a=((x-1)*(y-1));
    b=((n-x)*(n-y));
    if(a>b)
    {
        printf("Black");
    }
    else
    {
        printf("White");
    }
}

#include <stdio.h>

int main(){
	int size=0, x=0, y=0;
	scanf("%d", &size);
	scanf("%d %d", &x, &y);

	if ((hyp(x-1,y-1)) < (hyp(size-x,size-y))) {
		printf("White");
	} else if ((hyp(x-1,y-1)) > (hyp(size-x,size-y))) {
		printf("Black");
	} else {
		printf("White");
	}
}

int hyp (int a, int b){
    return sqrt(a*a + b*b);
}

#include <stdio.h>

 int main()
 { long long int w,b,n,x,y;
	 scanf("%I64d",&n);
	 scanf("%I64d %I64d",&x,&y);
	 w=(x-1)*(x-1) + (y-1)*(y-1);
	 b=(n-x)*(n-x) + (n-y)*(n-y);
	 if (w>b)
{
	printf("Black");
}
else{
	printf("White");
}
}

#include <stdio.h>
#include <math.h>
int main()
{
	long long int n,x,y,a,b;
	long double d1,d2;
	scanf("%lld",&n);
	scanf("%lld%lld",&x,&y);
	a=(x-1)*(x-1) + (y-1)*(y-1);
	b=(n-x)*(n-x) + (n-y)*(n-y);
	d1=sqrtl(a);
	d2=sqrtl(b);
	if(d1<=d2)
	{
		printf("White");
		}
	if(d1>d2)
	{
		printf("Black");
		}
	return 0;
}

#include <stdio.h>
#include <string.h>

int main(){
    int n , x , y ;
    scanf("%d",&n);
    scanf("%d%d",&x,&y);
    if(x+y <= n+1)
        printf("White");
    else
    {
        printf("Black");
    }

}


Три брата договорились о встрече. Пронумеруем братьев следующим образом: пусть старший брат имеет номер 1, средний брат имеет номер 2, а младший брат — номер 3. Когда пришло время встречи, один из братьев опоздал. По заданным номерам двух братьев, которые пришли вовремя, вам предстоит определить номер опоздавшего брата.

В первой строке входных данных следуют два различных целых числа a и b (1 ≤ a, b ≤ 3, a ≠ b) — номера братьев, которые пришли на встречу вовремя. Номера даны в произвольном порядке.

Выведите единственное целое число — номер брата, который опоздал на встречу.

#include <stdio.h>

int main(int argc, char* argv[])
{
  int a, b;
  scanf("%d %d", &a, &b);
  printf("%d\n", 6 - a - b);
}

#include<stdio.h>
int main()
{
    int a,b;
    scanf("%i%i",&a,&b);
    printf("%i",6-a-b);
}

#include <stdio.h>

int a, b;

int main()
{
    scanf("%i %i", &a, &b);
    printf("%i", 6-(a+b));
    return 0;
}

#include<stdio.h>

main()
{
int a,b;
scanf("%d%d",&a,&b);
printf("%d",6-a-b);
return 0;
}


Kavi has $$$2n$$$ points lying on the $$$OX$$$ axis, $$$i$$$-th of which is located at $$$x = i$$$.Kavi considers all ways to split these $$$2n$$$ points into $$$n$$$ pairs. Among those, he is interested in good pairings, which are defined as follows:Consider $$$n$$$ segments with ends at the points in correspondent pairs. The pairing is called good, if for every $$$2$$$ different segments $$$A$$$ and $$$B$$$ among those, at least one of the following holds:  One of the segments $$$A$$$ and $$$B$$$ lies completely inside the other.  $$$A$$$ and $$$B$$$ have the same length. Consider the following example:  $$$A$$$ is a good pairing since the red segment lies completely inside the blue segment.$$$B$$$ is a good pairing since the red and the blue segment have the same length.$$$C$$$ is not a good pairing since none of the red or blue segments lies inside the other, neither do they have the same size.Kavi is interested in the number of good pairings, so he wants you to find it for him. As the result can be large, find this number modulo $$$998244353$$$.Two pairings are called different, if some two points are in one pair in some pairing and in different pairs in another.

The single line of the input contains a single integer $$$n$$$ $$$(1\le n \le 10^6)$$$.

Print the number of good pairings modulo $$$998244353$$$.

NoteThe good pairings for the second example are:   In the third example, the good pairings are:

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main()
{
    int n;
    scanf("%d",&n);
    int a[n];
    a[0]=1;
    a[1]=3;
    a[2]=6;
    int sum=a[0]+a[1]+a[2];
    int factors[n];
    for(int i=0;i<n;i++)factors[i]=0;
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j=j+i+1){
            factors[j]++;
        }
    }
    for(int j=3;j<n;j++){
        a[j]=(sum+factors[j])%998244353;
        sum=(sum+a[j])%998244353;
    }
    printf("%d\n",a[n-1]);
    return 0;
}

#include <stdio.h>
#include<stdlib.h>
typedef long long lol;

int main()
{
    lol n, M = 998244353;
    scanf("%lld",&n);
    lol arr[n+1],id=2;
    lol pr[1000000];
    pr[0]=2;
    pr[1]=3;
    lol i,j,k,p,ct,i1;
    arr[1]=1;
    for(i=2;i<=n;i++)
    {
        p=0;
        while((p<id) && (i%(pr[p])!=0) && (pr[p]*pr[p]<i)) p++;
        if(pr[p]*pr[p]>i)
        {
            arr[i]=2;
            pr[id]=i;
            id++;
            continue;
        }
        p = pr[p];
        ct = 0;
        i1=i;
        while(i1%p==0)
        {
            ct++;
            i1/=p;
        }
        arr[i] = arr[i1]*(ct+1);
    }
    lol ex = 1;
    lol ans = arr[n]%M, a1;
    for(i=1;i<n;i++)
    {
        a1 = (ex*arr[n-i])%M;
        ans+=a1;
        ans%=M;
        ex*=2;
        ex%=M;
    }
    printf("%lld",ans);
    return 0;
}

#include <stdio.h>

#define N	1000000
#define MD	998244353

int kk[N + 1];

void init() {
	int i, j;

	for (i = 1; i <= N; i++)
		for (j = i; j <= N; j += i)
			kk[j]++;
}

int main() {
	int n, i, x, y;

	init();
	scanf("%d", &n);
	x = y = 1;
	for (i = 2; i <= n; i++)
		y = (y + (x = (y + kk[i]) % MD)) % MD;
	printf("%d\n", x);
	return 0;
}

#include <stdio.h>
#include <math.h>

long long int a[1000001];
long long int sum[1000001];

int main(void){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j+=i){
			a[j]++;
		}
	}
	sum[1]=1;
	for(int i=2;i<=n;i++){
		a[i]+=sum[i-1]%998244353;
		sum[i]=sum[i-1]+a[i];
	}
	printf("%lld",a[n]);
}

#include <stdio.h>
typedef long long ll;
const int mod = 998244353;
int n;
int dp[1000005];
int main()
{
   scanf("%d",&n);
    //memset(dp,0,sizeof(dp));
    for(int i = 1; i<=n; i++)
    {
        for(int j =i; j<=n; j+=i)
        {
            dp[j]++;
        }

    }
    int sum = 0;
    for (int i = 1; i <= n; i++)
    {
        dp[i] = (dp[i] + sum) % mod;
        sum = (sum + dp[i]) % mod;
    }
    printf("%d\n",dp[n]);
    //cout << dp[n] <<endl;
    return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

int dp[1000001];

int main()
{
	int N;
	scanf("%d", &N);
	int pref = 0;

	for (int i = 1; i <= N; i++)
		for (int j = i; j <= N; j += i)
			dp[j]++;

	const int mod = 998244353;

	for (int i = 1; i <= N; i++) {
		dp[i] = (dp[i] + pref) % mod;
		pref = (dp[i] + pref) % mod;
	}
	printf("%d\n", dp[N]);
	return 0;
}

#include <stdio.h>
#include<stdlib.h>
typedef long long lol;

int main()
{
    lol n, M = 998244353;
    scanf("%lld",&n);
    lol arr[n+1],id=2;
    lol pr[1000000];
    pr[0]=2;
    pr[1]=3;
    lol i,j,k,p,ct,i1;
    arr[1]=1;
    for(i=2;i<=n;i++)
    {
        p=0;
        while((p<id) && (i%(pr[p])!=0) && (pr[p]*pr[p]<i)) p++;
        if(p==id)
        {
            arr[i]=2;
            pr[id]=i;
            id++;
            continue;
        }
        p = pr[p];
        ct = 0;
        i1=i;
        while(i1%p==0)
        {
            ct++;
            i1/=p;
        }
        arr[i] = arr[i1]*(ct+1);
    }
    lol ex = 1;
    lol ans = arr[n]%M, a1;
    for(i=1;i<n;i++)
    {
        a1 = (ex*arr[n-i])%M;
        ans+=a1;
        ans%=M;
        ex*=2;
        ex%=M;
    }
    printf("%lld",ans);
    return 0;
}

/* main.c */

// D <--~~~  __      _
// U       o'')}____//
// O       `_/      )
// N       (_(_/-(_/
// G ~~~~~~~~~~~~~~~~~-->

#include <stdio.h>
#include <stdlib.h>

#define loop(i, a, b) for(ll i=a; i<b; i++)

typedef long long ll;

const ll MOD_PRIME = 10e9 + 7;

void solve(){
    ll n, S;
    scanf("%lld", &n);
    ll* dp = calloc(n+1, sizeof(ll));
    loop(i, 1, n+1){
        for(int j=i+i; j<n+1; j+=i){
            dp[j]++;
        }
    }
    dp[0] = S = 1;
    loop(i, 1, n+1){
        dp[i] += S;
        S += dp[i];
        dp[i] %= 998244353;
    }
    printf("%lld", dp[n]);
    return;
}

int main(void){
    int T=1;
    //scanf("%d", &T);
    loop(t, 0, T){
        solve();
    }
    return 0;
}