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

using namespace std;

int binary_ones(int num)
{
    int res = 0;
    while (num > 0) {
        if (num % 2 == 1) {
            res++;
        }
        num >>= 1;
    }
    return res;
}

int main()
{
    int n;
    string s;

    map<int, char> z;
    for (char x = 'a'; x <= 'z'; x++) {
        z[binary_ones(x)] = x;
    }

    // 3, 4, 5, 6 x 1

    ios_base::sync_with_stdio(false);

    cin >> n;
    cin >> s;

    int one = 0, zero = 0;
    for (int i = 0; i < 8 * n; i++) {
        if (s[i] == '1')
            one++;
        else if (s[i] == '0')
            zero++;
    }

    // proporcje one : zero
    if (5 * one < 3 * zero) {
        cout << "NIE" << endl;
    }
    else if (2 * one > 6 * zero) {
        cout << "NIE" << endl;
    }
    else {
        string res;
        while (one > 0 && zero > 0) {
            int candidate = (8 * one) / ((one + zero));
            res += z[candidate];

            one -= candidate;
            zero -= 8 - candidate;
        }

        cout << res << endl;
    }
}