/*
first run：能用若干次询问确定 ai,ki
second run 会得到 这些询问排序后的结果，只需要把这些询问的结果是怎样的排列传给 second run 即可
选一个 hash%mod=sum 使得之前那些有效询问都 !=sum
随机若干个串的 hash 结果，使得 hash%mod=sum，second run 就可以区分两种信息
从这些串的 hash 结果串中选出一个上升序列，来传输这个排列 p. 
每次找下一个 hash2(s)=i 的串传输即可。
no time to write code TAT
*/
#include <stdio.h>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>

using namespace std;

const int PART1_QUERIES = 41;

long long mod = 141167095653376LL;
long long X;
int P[10];

long long hash0[11];
long long a[11];
long long b[11];
long long b2[11];

long long add(long long a, long long b) {
	return (a + b) % mod;
}

long long sub(long long a, long long b) {
	return ((a - b) % mod + mod) % mod;
}

long long add(long long a, long long b, long long c) {
	return add(add(a, b), c);
}

long long mult(long long a, long long b) {
	if (a < 0) a += mod;
	if (b < 10) {
		return (a * b) % mod;
	}
	if (b % 2 == 0) {
		return (mult(a, b / 2) * 2) % mod;
	} else {
		return (mult(a, b - 1) + a) % mod;
	}
}

long long power(long long a, long long b) {
	long long res = 1;
	while (b) {
		if (b & 1) res = mult(res, a);
		a = mult(a, a);
		b >>= 1;
	}
	return res;
}

long long diff[10];

string print_hash(long long value) {
	string res;
	for (int i = 0; i < 10; i++) {
		res = ((char)(value % 26 + 'a')) + res;
		value /= 26;
	}
	return res;
}

map<string, long long> cache;

vector<pair<string, int>> queries;

long long query(string s, bool rec = true) {
	if (cache.find(s) != cache.end()) return cache[s];
	printf("%s\n", s.c_str());
	fflush(stdout);
	char res[11];
	scanf("%s", res);

	long long value = 0;
	for (int i = 0; i < 10; i++) {
		value = value * 26 + (res[i] - 'a');
	}

	if (rec) queries.push_back({res, (int) queries.size()});
	return cache[s] = value;
}

string get_hash(const string s) {
	int first = 0;
	for (int k = 0; k < 10; k++) {
		for (int j = 0; j < 10; j++) {
			if (s[j] == first + 'a') {
				first++;
			}
		}
	}

	long long cur = hash0[first];

	for (int j = 0; j < 10; j++) {
		for (int k = first; k < s[j] - 'a'; k++) {
			cur = add(cur, diff[j]);
			cur = add(cur, mult(b2[j], k + 1));
		}
		for (int k = first; k > s[j] - 'a'; k--) {
			cur = sub(cur, diff[j]);
			cur = sub(cur, mult(b2[j], k));
		}
	}

	cur = 0;

	for (int j = 0; j < 10; j++) {
		cur = add(cur, add(mult(a[j], s[j] - 'a' + 1), mult(b[j], power(s[j] - 'a' + 1, 2))));
	}

	return print_hash(cur);
}

long long get_info(string s, int sum, int mod) {
	int val = 0;
	for (size_t i = 0; i < s.size(); i++) {
		val = (val + s[i]) % (PART1_QUERIES + 1);
	}
	if (val != sum) return -1;

	int res = 0;
	for (size_t i = 0; i < s.size(); i += 2) {
		res = (res + s[i]) % mod;
	}
	return res;
}

string generate_random_string() {
	string res;
	for (int i = 0; i < 10; i++) {
		res += 'a' + rand() % 26;
	}
	return res;
}

void determine_hash_calc(function<long long (string)> query) {
	string s0 = "aaaaaaaaaa";
	hash0[0] = query(s0);
	for (int i = 0; i < 10; i++) {
		string s = s0;
		s[i] = 'b';
		long long res = query(s);
		long long hash = sub(res, hash0[0]);

		diff[i] = hash;

	}

	for (int i = 0; i < 10; i++) {
		string s;
		s = "bbbbbbbbbb";
		long long hash0 = query(s);
		s[i] = 'a';
		long long hash1 = sub(hash0, query(s));
		s = "cccccccccc";
		hash0 = query(s);
		s[i] = 'b';
		long long hash2 = sub(hash0, query(s));
		b2[i] = sub(hash2, hash1);
		b[i] = b2[i] / 2;
		a[i] = sub(hash1, mult(3, b[i]));
		diff[i] = sub(diff[i], b2[i]);
	}

	for (int i = 1; i <= 10; i++) {
		string s;
		for (int j = 0; j < 10; j++) {
			s += 'a' + i;
		}
		hash0[i] = query(s);
	}


}

void part1() {
	determine_hash_calc([](string s){return query(s);});

	set<int> used;

	for (auto [s, _]: queries) {
		int val = 0;
		for (size_t i = 0; i < s.size(); i++) {
			val = (val + s[i]) % (queries.size() + 1);
		}
		used.insert(val);
	}

	int sum = -1;

	for (size_t i = 0; i < queries.size() + 1; i++) {
		if (used.find(i) == used.end()) {
			sum = i;
			break;
		}
	}

	vector<pair<string, string>> aux;

	while (aux.size() < 5000) {
		string s = generate_random_string();
		string hash = get_hash(s);
		if (get_info(hash, sum, cache.size()) != -1) {
			aux.push_back({hash, s});
		}
	}

	sort(queries.begin(), queries.end());
	sort(aux.begin(), aux.end());

	size_t cur = 0;

	size_t rem = queries.size();

	for (size_t i = 0; i < aux.size() && cur < queries.size(); i++) {
		int info = get_info(aux[i].first, sum, rem);
		if (info == queries[cur].second) {
			query(aux[i].second, false);
			rem--;
			for (size_t j = cur + 1; j < queries.size(); j++) {
				if (queries[j].second > queries[cur].second) queries[j].second--;
			}
			cur++;
		}
	}

	printf("done\n");
	fflush(stdout);
}

void part2() {
	int m;
	scanf("%d", &m);

	vector<string> responses;

	for (int i = 0; i < m; i++) {
		char tmp[11];
		scanf("%s", tmp);
		responses.push_back(tmp);
	}
	sort(responses.begin(), responses.end());
	map<int, int> cnt;
	for (size_t i = 0; i < responses.size(); i++) {
		int val = 0;
		for (size_t j = 0; j < responses[i].size(); j++) {
			val = (val + responses[i][j]) % (PART1_QUERIES + 1);
		}
		cnt[val]++;
	}

	int sum = -1;
	int cnt_max = 0;

	for (auto e: cnt) {
		if (e.second > cnt_max) {
			sum = e.first;
			cnt_max = e.second;
		}
	}

	vector<int> p(PART1_QUERIES, -1);

	vector<string> queries;

	int rem = PART1_QUERIES;
	int cur = 0;

	for (size_t i = 0; i < responses.size(); i++) {
		int info = get_info(responses[i], sum, rem);
		if (info != -1) {
			int c = info;
			for (size_t j = 0; j < p.size(); j++) {
				if (p[j] == -1) {
					if (c == 0) {
						p[j] = cur;
						break;
					}
					c--;
				}
			}
			rem--;
			cur++;
		} else {
			queries.push_back(responses[i]);
		}
	}

	vector<pair<int, string>> outputs;

	for (size_t i = 0; i < p.size(); i++) {
		outputs.push_back({i, queries[p[i]]});
	}

	sort(outputs.begin(), outputs.end());

	determine_hash_calc([&outputs](string s) {
		if (cache.find(s) != cache.end()) return cache[s];
		string res = outputs[0].second;

		outputs.erase(outputs.begin(), outputs.begin() + 1);

		long long value = 0;
		for (int i = 0; i < 10; i++) {
			value = value * 26 + (res[i] - 'a');
		}
		return cache[s] = value;
	});

	for (int i = 0; i < 100; i++) {
		char s[11];
		scanf("%s", s);

		printf("%s\n", get_hash(s).c_str());
		fflush(stdout);
	}
}

int main() {

	int run;

	scanf("%d", &run);

	if (run == 1) {
		part1();
	}

	if (run == 2) {
		part2();
	}
                           
	return 0;
}