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
#include<bits/stdc++.h>
using namespace std;
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<<$<<"; "),...)<<'\n';}(x)
#else
#define debug(...) {}
#endif

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

	vector<char> hmm(9);
	hmm[3] = 'a';
	hmm[4] = 'c';
	hmm[5] = 'g';
	hmm[6] = 'o';
	int n;
	cin >> n;
	string s;
	cin >> s;
	vector<int> cnt(2);
	REP(i,n * 8) {
		++cnt[s.at(i) - '0'];
	}
	vector<char> ans;
	REP(i, n - 1) {
		if (cnt[0] < cnt[1]) {
			ans.emplace_back(hmm[6]);
			cnt[0] -= 2;
			cnt[1] -= 6;
		}
		else if (cnt[0] > cnt[1]) {
			ans.emplace_back(hmm[3]);
			cnt[0] -= 5;
			cnt[1] -= 3;
		}
		else {
			ans.emplace_back(hmm[4]);
			cnt[0] -= 4;
			cnt[1] -= 4;
		}
	}
	if (cnt[1] < 3 || cnt[1] > 6) {
		cout << "NIE\n";
		return 0;
	}
	ans.emplace_back(hmm[cnt[1]]);
	for (auto xd : ans) {
		cout << xd;
	}
	cout << '\n';
}