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
68
69
70
71
72
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <set>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

#define pb push_back
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;

using namespace std;


// 3 -> a
// 4 -> c
// 5 -> g
// 6 -> o
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  int n;
  string bits;

  cin >> n;
  cin >> bits;

  int ones = 0;
  int total = 8 * n;

  for (int i=0; i<total; ++i) {
    if (bits[i] == '1') ones++;
  }

  if (ones >= 3 * n && ones <= 6 * n) {
    int missing = ones - 3*n;
    for (int i=0; i<n; ++i) {
      if (missing == 0) {
        cout << "a";
      } else if (missing == 1) {
        cout << "c";
        missing = 0;
      } else if (missing == 2) {
        cout << "g";
        missing = 0;
      } else {
        cout << "o";
        missing -= 3;
      }
    }

    cout << endl;
  } else {
    cout << "NIE" << endl;
  }

  return 0;
}