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

using namespace std;

constexpr int MAXN = 1e5 + 10;

int n;

char a[8*MAXN];

char x[7] = {'0', '0', '0', 'a', 'c', 'k', 'o'};

int main()
{
    cin >> n;

    cin >> a;

    int il = 0;

    for (int i = 0; i <= 8*n-1; i++)
    {
        if (a[i] == '1')
            il++;
    }

    if (il < 3*n || il > 6*n)
    {
        cout << "NIE";
        return 0;
    }
    else 
    {
        int mod = il%n;

        int ws = (il-mod)/n;

        //cout << il << ' ' << mod << ' ' << ws << endl; 

        vector <int> res(n, ws);

        int i = 0;

        while (mod > 0)
        {
            if (res[i] == 6)
                i++;

            res[i]++;
            mod--;       
        }

        for (auto u : res)
        {
            cout << x[u];
        }
    }


    




}