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
#include <bits/stdc++.h>
#define qio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define debug(x) cerr<<#x<<" "<<x<<endl
#define ll long long 
#define st first
#define nd second
using namespace std;

int n, t, ile, res, wynik[5];
char tab[10];
string s;
int main()
{
	qio;
	cin >> n;
	cin >> s;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '1') ile++;
	}
	ile -= n * 3;
	if (ile<0 || (ile + 2) / 3>n) {
		cout << "NIE" << endl;
		return 0;
	}
	tab[0] = 'a';
	tab[1] = 'c';
	tab[2] = 'g';
	tab[3] = 'o';
	wynik[3] += ile / 3;
	n -= ile / 3;
	ile %= 3;
	wynik[ile]++;
	n--;
	wynik[0] += n;

	for (int i = 0; i <= 3; i++) {
		while (wynik[i] > 0) {
			wynik[i]--;
			cout << tab[i];
		}
	}
	cout << endl;

}