#include <cstdio>
#include <vector> 
#include <algorithm>
#include <cstring>

#define X first
#define Y second
#define PB push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)

using namespace std; 

typedef pair<int, int> pii;

const int T = 1440;
const int N = 110;
const int DEB = 0;

char inp[N], out[N];
bool state[N][T]; 

int n;

char* time(int t) { 
	int h = t / 60, m = t % 60;
	out[0] = h / 10 + '0';
	out[1] = h % 10 + '0';
	out[2] = ':';
	out[3] = m / 10 + '0';
	out[4] = m % 10 + '0';
	return out;
}

bool query(int t, int x) { 
	printf("at %.5s check %d\n", time(t), x + 1);
	fflush(stdout);
	
	if(DEB) { 
		return state[x][t];		
	} 
	scanf("%s", inp);
	return inp[1] == 's';
}

int cur[N];
int ans[N];
vector<pii> s;

void answer() {
	printf("answer\n");
	for(int i = 0; i < n; ++i) { 
		printf("%.5s\n", time(ans[i]));
	}
	fflush(stdout);
}

int main() { 
	memset(ans, -1, sizeof(ans));
	scanf("%d", &n);

	if(DEB) { 
		for(int i = 0; i < n; ++i) { 
			char x, y, z, w; 
			scanf(" %c%c:%c%c ", &x, &y, &z, &w);
			int a = x - '0', b = y - '0', c = z - '0', d = w - '0';
			for(int j = 60 * (10 * a + b) + 10 * c + d, k = 0; k < T / 2; ++k, j = (j + 1) % T) { 
				state[i][j] = 1;
			}
		}
	}

	for(int i = 0; i < n; ++i) {
		cur[i] = query(0, i);
	}

	for(int i = 0, j = 49; i != T / 2 - 1; i += j, -- j) { 
		if(i + j >= T / 2) { 
			j = T / 2 - 1 - i;
		}

		for(int k = 0; k < n; ++k) { 
			if(ans[k] == -1 && query(i + j, k) != cur[k]) { 
				ans[k] = i + j;
				for(int l = i + 1; l < i + j; ++l) { 
					s.PB({(l + T / 2) % T, k});
				}
			}
		}
	}

	sort(s.begin(), s.end());
	for(pii p : s) { 
		if(query(p.X, p.Y) == cur[p.Y]) { 
			ans[p.Y] = min(ans[p.Y], (p.X - T / 2 + T) % T);
		}
	}

	for(int i = 0; i < n; ++i) { 
		if(ans[i] == -1) { 
			ans[i] = T / 2;
		}
		if(cur[i]) { 
			ans[i] = ans[i] + T / 2;
		}
		ans[i] %= T;
	}

	answer();
	return 0;
}