#include <bits/stdc++.h>
using namespace std;
const int dr[] = {0, -1, 0, 1, -1, 1, 1, -1};
const int dc[] = {1, 0, -1, 0, 1, 1, -1, -1};
const double eps = 1e-9;
template <class T>
void print(const vector<T> &v) {
  ostringstream os;
  for (int i = 0; i < (int)v.size(); ++i) {
    if (i) os << ' ';
    os << v[i];
  }
  cout << os.str() << endl;
}
template <class T>
int sz(const T &c) {
  return (int)c.size();
}
template <class T>
void srt(T &c) {
  sort(c.begin(), c.end());
}
template <class T>
void checkmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
void checkmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T, class U>
T cast(U x) {
  ostringstream os;
  os << x;
  T res;
  istringstream is(os.str());
  is >> res;
  return res;
}
template <class T>
vector<T> split(string s, string x = " ") {
  vector<T> res;
  for (int i = 0; i < s.size(); i++) {
    string a;
    while (i < (int)s.size() && x.find(s[i]) == string::npos) a += s[i++];
    if (!a.empty()) res.push_back(cast<T>(a));
  }
  return res;
}
template <class T>
bool inside(T r, T c, T R, T C) {
  return r >= 0 && r < R && c >= 0 && c < C;
}
int main(int argc, char *argv[]) {
  int x, y;
  cin >> x >> y;
  int p = 0;
  if (x < 0) p++;
  if (y < 0) p++;
  x = abs(x);
  y = abs(y);
  string a[] = {"white", "black"};
  for (int i(0), _n(1500); i < _n; ++i) {
    if (x * x + y * y == i * i) {
      p = 1;
      goto m1;
    }
  }
  for (int i(0), _n(1500); i < _n; ++i) {
    if (x * x + y * y > i * i && x * x + y * y < sqr(i + 1)) {
      p += i + 1;
      break;
    }
  }
m1:
  cout << a[p % 2] << endl;
  return 0;
}
