// Saint Bonaventure University Programming Contest
// February 15, 2008

// Problem #6 - Bomb Defusal
// Team Name: SOLUTION


#include <iostream>
using namespace std;
#include "apstring.h"
#include "apvector.h"
#include "bombMeter.h"

apstring duplicate(char c);
apstring nextAnagramString(const apstring & s);
apstring sortString(const apstring & s);


int main(void) {
	int serialNum;
	cin >> serialNum;
	BombMeter bm(serialNum);
	apstring answer = "";
	
	// Get an anagram of the code
	for (char c='A'; c<='Z'; c++) {
		apstring toTest = duplicate(c);
		bm.test(toTest);
		for (int i=0; i<bm.getAccurateLetters(); i++) {
			answer += c;
		}
	}
//	cout << answer << endl;
//	bm.printDecode();
	
	while (true) {
		bm.test(answer);
		if (bm.getAccurateLetters()==5) {
			break;
		}
		answer = nextAnagramString(answer);
	}
	
	cout << bm.defuse(answer) << endl;
	return EXIT_SUCCESS;
}

	
apstring duplicate(char c) {
	apstring s = "";
	for (int i=0; i<5; i++) {
		s += c;
	}
	return s;
}
	
apstring nextAnagramString(const apstring & s) {
	// Find point of inversion
	int invPt = s.length()-1;
	while ((invPt>0) && (s[invPt]<=s[invPt-1])) {
		invPt--;
	}
	if (invPt==0) {
		return sortString(s);
	}
	invPt--;
	
	// Find replacement char
	int repLoc = invPt+1;
	for (int k = repLoc+1; k<s.length(); k++) {
		if  (s[k] > s[invPt] && s[k] < s[repLoc]) {
			repLoc = k;
		}
	}
	 
	apstring prefix = s.substr(0,invPt);
	char rep = s[repLoc];
	apstring suffix = "";
	for (int j = invPt; j<s.length(); j++) {
		if (j != repLoc) {
			suffix += s[j];
		}
	}	
	suffix = sortString(suffix);
		
	return prefix + rep + suffix;
}
	
apstring sortString(const apstring & s) {
	apvector<char> c(s.length());	
	for (int i=0; i<s.length(); i++) {
		c[i] = s[i];
	}
	
	for (int k=0; k<s.length(); k++) {
		for (int j=k+1; j<s.length(); j++) {
			if (c[k]>c[j]) {
				char t = c[k];
				c[k] = c[j];
				c[j] = t; 
			}
		}
	}
	apstring ans = "";
	for (int i=0; i<s.length(); i++) {
		ans += c[i];
	}
	return ans;
}