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
#include<bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pi>;
#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define ALLD(c) (c).rbegin(), (c).rend()
#define SIZE(x) ((int)(x).size())
#define pb push_back
#define pp emplace_back
#define st first
#define nd second
#define sq(a) (a)*(a)
const int inf = 1000000001;
const double eps = 1e-9;
bool fleq(double a, double b){
	return abs(a - b) < eps;
}
// 3 a
// 4 c
// 5 g
// 6 o
int n;
char t[7];
int ones;
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
    t[3] = 'a';
    t[4] = 'c';
    t[5] = 'g';
    t[6] = 'o';
    cin >> n;
    string s;
    cin >> s;
    REP(i, 8 * n){
        if(s[i] == '1')ones++;
    }
    if(ones < 3 * n || ones > 6 * n){
        cout << "NIE\n";
        return 0;
    }
    REP(i, n){
        int x = ones/(n - i);
        cout << t[x];
        ones -= x;
    }
	return 0;
}