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
#include <cstring>
#include <cstdio>
#include <map>

const int max_n = 500011;
char input[8 * max_n];
int c[2];
int n, m;

int p;
char output[max_n];

int main() {
  scanf("%d", &n);
  m = 8 * n;
  scanf("%s", &input);
  c[0] = c[1] = 0;
  for (int i = 0; i < m; ++i) ++c[input[i] - '0'];
  c[0] -= 2 * n;
  c[1] -= 3 * n;
  if (c[0] < 0 || c[1] < 0) {
    printf("NIE\n");
    return 0;
  }
  p = 0;
  if (c[0] % 3 == 1) {
    output[p++] = 'g';
    c[0] -= 1;
    c[1] -= 2;
  }
  if (c[0] % 3 == 2) {
    output[p++] = 'c';
    c[0] -= 2;
    c[1] -= 1;
  }
  while (c[0] > 0) {
    output[p++] = 'a';
    c[0] -= 3; 
  }
  while (c[1] > 0) {
    output[p++] = 'w';
    c[1] -= 3; 
  } 
  output[p] = 0;
  printf("%s\n", output);
  return 0;
}