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
#include <cstdio>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <vector>
using namespace std;

int n;
char buf[999999];

int main() {
	scanf("%d%s", &n, buf);
	int nn = n * 8;
	int sum = 0;
	for (int i = 0; i < nn; ++i) if (buf[i] == '1') ++sum;

	if (n * 3 <= sum && sum <= n * 6) {
		int base = sum / n;
		int second = sum - base * n;
		int first = n - second;
		for (int i = 0; i < first; ++i) printf("%c", "012aeuo"[base]);
		for (int i = 0; i < second; ++i) printf("%c", "012aeuo"[base + 1]);
		printf("\n");
	}
	else {
		printf("NIE\n");
	}

	return 0;
}