#include <bits/stdc++.h>
using namespace std;
long long int power(long long int first, long long int second,
                    long long int m) {
  if (second == 0) return 1;
  long long int p = power(first, second / 2, m) % m;
  p = (p * p) % m;
  return (second % 2 == 0) ? p : (first * p) % m;
}
long long int sum_upto(long long int l) {
  long long int num[2] = {0};
  long long int t_ind = 1;
  long long int flag = 1;
  long long int sum = 0;
  while (sum + t_ind < l) {
    num[flag] += t_ind;
    sum += t_ind;
    t_ind *= 2;
    flag = 1 - flag;
  }
  num[flag] += l - sum;
  sum = ((power(num[0], 2, 1000000007) + num[0] % 1000000007) % 1000000007 +
         power(num[1], 2, 1000000007)) %
        1000000007;
  return sum;
}
int main(void) {
  long long int n;
  cin >> n;
  if (n % 2) {
    cout << "black" << endl;
  } else {
    cout << "white\n1 2\n";
  }
}
