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
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

char s[801013];

int main() {
	int n;
	scanf("%d %s", &n, s);
	int j = 0;
	for (int i = 0; i < 8*n; i++) if(s[i] == '1') j++;
//	printf("%d\n",j);
	if (j < 3*n || j > 6*n) {
		puts("NIE");
		return 0;
	}
	j -= 3*n;
	for (int i = 0; i < j/3; i++) s[i] = 'o';
  for (int i = j/3; i < n; i++) s[i] = 'a';
	if (j % 3 == 1) s[j/3] = 'c';
	else if (j % 3 == 2) s[j/3] = 'g';	
	s[n] = 0;
	puts(s);
	return 0;
}