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
#include <iostream>
#include <string>

using namespace std;

void solve(){
    int n;
    cin >> n;

    string bits;
    cin >> bits;

    int count0 = 0, count1 = 0;
    for(int i = 0; i < bits.size(); i++) {
        if(bits[i] == '0') count0++;
        else count1++;
    }

    count0 -= 2 * n;
    count1 -= 3 * n;

    if(count0 < 0 || count1 < 0) {
        cout << "NIE\n";
        return;
    }

    while(count0 >= 3) {
        cout << "a";
        count0 -= 3;
    }
    while(count1 >= 3) {
        cout << "o";
        count1 -= 3;
    }

    if(count0 == 2) {
        cout << "x";
    }
    else if(count0 == 1){
        cout << "z";
    }

    cout << "\n";
    
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}