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
66
67
// Karol Kosinski 2021
#include <bits/stdc++.h>
#define ENABLE_DEBUG
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define TIE(x...) int x;tie(x)
#define X first
#define Y second
#ifndef ENABLE_DEBUG
#define DEB(k,f,x...)
#else
#define DEB(k,f,x...) {if(k)printf("--------%4d : %s\n",__LINE__,__FUNCTION__);f(x);}
#endif
#define DEBL DEB(1,void,0)
#define DEBF(f,x...) DEB(1,f,x)
#define DEBUG(x...) DEB(0,printf,x)
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;

constexpr int NX = 100'001;

char B[ NX * 8 ];
char R[NX];

int main()
{
    int n;
    scanf("%d%s", &n, B);
    int n8 = n * 8, counter = 0;
    FOR(i,0,n8) if ( B[i] == '1' ) ++ counter;
    if (counter < 3 * n)
    {
        printf("NIE\n");
    }
    else if (counter <= 4 * n)
    {
        int lim = 4 * n - counter;
        FOR(i,0,lim) R[i] = 'a';
        FOR(i,lim,n) R[i] = 'e';
        printf("%s\n", R);
    }
    else if (counter <= 5 * n)
    {
        int lim = 5 * n - counter;
        FOR(i,0,lim) R[i] = 'e';
        FOR(i,lim,n) R[i] = 'u';
        printf("%s\n", R);
    }
    else if (counter <= 6 * n)
    {
        int lim = 6 * n - counter;
        FOR(i,0,lim) R[i] = 'u';
        FOR(i,lim,n) R[i] = 'o';
        printf("%s\n", R);
    }
    else
    {
        printf("NIE\n");
    }
    return 0;
}