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
#include<iostream>

using namespace std;

int n;

char letters[] = {
   '-',
   '-',
   '-',
   'a',
   'c',
   'g',
   'o',
   '-',
   '-',
};

int main() {

   cin >> n;

   int onecnt = 0;
   for(int i = 0; i < 8*n; i++) {
      char c;
      cin >> c;
      if(c == '1') {
         onecnt++;
      }
   }
   
   int div = onecnt / n;
   int mod = onecnt % n;

   if(letters[div] == '-') {
      goto bad;
   }

   if(mod > 0 && letters[div + 1] == '-') {
      goto bad;
   }

   for(int i = 0; i < mod; i++) {
      cout << letters[div + 1];
   }

   for(int i = 0; i < n - mod; i++) {
      cout << letters[div];
   }
   cout << endl;
   return 0;

bad:
   cout << "NIE" << endl;
   return 0;
}