#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <bitset>

using namespace std;

#define rep(i,s,N) for(int i=s;i<N;i++)
typedef long long int lli;

//#define MOD 100000000
//#define MOD 998244353


int main(void)
{
	int N; cin >> N;
	set<int> A;
	rep(i, 0, N) {
		int a; cin >> a;
		A.insert(a);
	}

	while (A.size() > 1) {
		int X = *(--A.end()); A.erase(--A.end());
		int x = *A.begin();
		A.insert(X - x);
	}
	cout << *A.begin() << endl;


	return 0;
}
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repp(i,k, n) for(int i = (int)(k); i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main(){
    int n; cin >> n;
    if(n%2 == 0) cout << "White" << endl;
    else cout << "Black" << endl;
}