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
/*
 *  Copyright (C) 2021  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;

	char bit;
	int sum = -2 * n;  // constant bits (5 and 6)

	for (int i = 0; i < 8 * n; ++i) {
		cin >> bit;
		if (bit == '1') {
			++sum;
		}
	}

	if (sum < n || sum > 4 * n) {
		cout << "NIE" << endl;
		return 0;
	}

	// decompose into layers (1-4 bits per character)
	int counter[5] = {0};
	for (int i = 1; i < 5; ++i) {
		counter[i] = min(n, sum);
		sum -= counter[i];
	}

	// count unique number for each layer an print copies of a letter
	int used = 0;
	char letters[5] = {' ', 'a', 'c', 'n', 'o'};
	for (int i = 4; i > 0; --i) {
		for (int j = 0; j < counter[i] - used; ++j) {
			cout << letters[i];
		}
		used = counter[i];
	}

	cout << endl;
	return 0;
}