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
#include<bits/stdc++.h>
using namespace std;


void solve() {
    int n, counter=0;
    char c;
    cin >> n;
    vector<char> result(n, '0');
    for (int i = 0; i < 8*n; i++) {
        cin >> c;
        if (c == '1') {
            counter++;
        }
    }
    if (counter < 3 * n) {
        cout << "NIE\n";
        return;
    }
    counter -= 3*n;
    if (counter <= n) {
        for (int i = 0; i < n; i++) {
            if (i < counter) {
                cout << "x";
            } else {
                cout << "d";
            }
        }
        cout << "\n";
        return;
    }
    counter -= n;
    if (counter <= n) {
        for (int i = 0; i < n; i++) {
            if (i < counter) {
                cout << "z";
            } else {
                cout << "i";
            }
        }
        cout << "\n";
        return;
    }
    counter -= n;
    if (counter <= n) {
        for (int i = 0; i < n; i++) {
            if (i < counter) {
                cout << "o";
            } else {
                cout << "k";
            }
        }
        cout << "\n";
        return;
    }
    cout << "NIE\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}