1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include "bits/stdc++.h" // Tomasz Nowak
using namespace std;     // University of Warsaw
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
	return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
	o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	string s;
	cin >> n >> s;
	assert(ssize(s) == 8 * n);
	map<int, char> m = {
		{3, 'a'},
		{4, 'c'},
		{5, 'g'},
		{6, 'o'},
	};

	int rem = 8 * n;
	int cnt1 = 0;
	for(char c : s)
		if(c == '1')
			++cnt1;

	auto no = [&] {
		cout << "NIE\n";
		exit(0);
	};

	string out;
	while(rem > 0) {
		if(cnt1 < 3)
			no();
		if(rem == 8 and cnt1 > 6)
			no();
		if(rem == 8) {
			out += m[cnt1];
			cnt1 = 0;
		}
		else {
			int aver = cnt1 / (rem / 8);
			aver = max(aver, 3);
			aver = min(aver, 6);
			if(cnt1 < rem / 2) {
				out += m[aver];
				cnt1 -= aver;
			}
			else {
				out += m[aver];
				cnt1 -= aver;
			}
		}
		rem -= 8;
	}
	cout << out.data() << '\n';
}