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
/*
	Zadanie: Zakłócenia
	Autor: Tomasz Kwiatkowski
*/

#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back

using namespace std;
typedef long long ll;

const int MAXN = 1000*1000 + 7;
const int INF = 1000*1000*1000 + 7;

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);
	
	int n;
	cin >> n;
	string data;
	cin >> data;

	int cnt1 = 0;
	for (auto bit : data) {
		if (bit == '1')
			++cnt1;
	}

	if (3*n <= cnt1	&& cnt1 <= 6*n) {
		string res(n, 'o');
		int sum = 6*n;
		while (sum > cnt1) {
			sum -= 3;
			res.pop_back();
		}
		if (sum - cnt1 == -1)
			res.pb('c');
		if (sum - cnt1 == -2)
			res.pb('g');
		while (res.size() < n)
			res.pb('a');
		cout << res << '\n';
	} else {
		cout << "NIE" << '\n';
	}
	return 0;
}