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

using namespace std;

int ones(int n)
{
    vector<char> s(8*(n + 1));
    fgets(&s[0], 8 * n + 1, stdin);
    int res = 0;
    for (int i = 0; i < 8 * n; i++)
        res += s[i] == '1';
    return res;
}

int main()
{
    vector<int> c(9, 0);
    for (int i = 'a'; i <= 'z'; i++) {
        int k = __builtin_popcount(i);
        if (c[k] == 0) c[k] = i;
    }
    int n;
    scanf("%d\n", &n);
    int k = ones(n);
    if (k < 3 * n || k > 6 * n) {
        printf("NIE\n");
        return 0;
    }
    while (n) {
        int i = k / n;
        putchar(c[i]);
        k -= i;
        n--;
    }
    putchar('\n');
    return 0;
}