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
71
72
73
74
75
76
77
78
79
80
81
82
83
// clang-format off
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;

map<int, char> mapa = {
	{0, 'a'},
	{1, 'c'},
	{2, 'g'},
	{3, 'o'},
};

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    /*for (int i = 'a'; i <= 'z'; i++) {
		int c = i;
		int ones = 0;
		cout << (char)c << " ";
		for (int j = 0; j < 8; j++) {
			ones += c % 2;
			c /= 2;
		}
		cout << ones << endl;
	}*/
	
	int n;
	int ones = 0;
	cin >> n;
	
	for (int i = 0; i < 8 * n; i++) {
		char c;
		cin >> c;
		if (c == '1') ones++;
	}
	
	ones -= n * 3;
	
	if (ones < 0 || n * 3 < ones) {
		cout << "NIE\n";
		cerr << ones << endl;
		return 0;
	}
	
	for (int i = 0; i < n; i++) {
		int cur = min(ones, 3ll);
		cout << mapa[cur];
		ones -= cur;
	}
    
    cout << endl;
    
    return 0;
}/*
2
1100000011110111

8
1011111010101100011011011010001010100011111111110001001001011010

1
00011000
*/