#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
void IOinit() {
	std::ios::sync_with_stdio(false), cin.tie(0);
#ifdef zqj
//	freopen("1.in", "r", stdin);
#endif
}
const int N = 105;
u64 dp[N][N];
int main() {
	IOinit();
	int n;
	cin >> n;
	u64 w = ((u64)1 << 2 * n);
	for(int i = 0;i < n;++i) {
		dp[i][n] = 0;
		dp[n][i] = 2 * w;
	}
	for(int i = n - 1;i >= 0;--i)
	for(int j = n - 1;j >= 0;--j)
		dp[i][j] = (dp[i + 1][j] + dp[i][j + 1]) / 2;

	int a = 0, b = 0;
	
	for(int i = 0;i < n * 2;++i) {
		u64 p = dp[a + 1][b] - dp[a][b];
		cout << p << std::endl;
		std::string s;
		cin >> s;
		if(s[0] == 'W') {
			w += p;
			++ a;
		} else {
			w -= p;
			++ b;
		}
		if(a == n || b == n) {
			return 0;
		}
	}
}