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
#include <bits/stdc++.h>
#include <iostream>

using namespace std;

int n, counter;
int val, res;
char b;
char map_[4] = {'a', 'c', 'g', 'o'};
int main() {
    cin >> n;
    for (int i = 0; i < 8*n; i++) {
        cin >> b;
        if (b == '1') {
            counter++;
        }
    }

    val = counter / n;
    res = counter % n;
    if (val < 3 || val > 6 || (val == 6 && res > 0)) {
        cout << "NIE" << endl;
        return 0;
    }
    for (int i = 0; i < n - res; i++) {
        cout << map_[val - 3];
    }
    for (int i = 0; i < res; i++) {
        cout << map_[val - 3 + 1];
    }
    cout << endl;
    return 0;
}