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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef double K;
constexpr int INF = 0x3f3f3f3f;

#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define TRAV(x, a) for(auto &x: (a))
#define SZ(x) ((int)(x).size())
#define PB push_back
#define X first
#define Y second


void solve() {
	int n;
	string s;
	cin >> n >> s;
	vector<ii> xd;
	FOR(i, 'a', 'z' + 1) xd.PB({__builtin_popcount(i) - 3, i});
	int balans = -3 * n;
	TRAV(x, s) balans += x == '1';
	string ans;
	FOR(i, 0, n) {
		int akt = min(balans, 3);
		TRAV(x, xd) {
			if(x.X == akt) {
				ans += (char)x.Y;
				balans -= akt;
				break;
			}
		}
	}
	if(balans != 0) ans = "NIE";
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	// int tt; cin >> tt;
	// FOR(te, 0, tt) {
	// 	// cout << "Case #" << te + 1 << ": ";
	// 	solve();
	// }
	solve();
	return 0;
}