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 <bits/stdc++.h>

#pragma GCC optimize(-O3)
#pragma GCC optimize(Ofast)
#pragma GCC optimize("unroll-loops")

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set
#define sqr(x) (x)*(x)
#define pw(x) (1ll << (x))
#define sz(x) (int)x.size()
#define fout(x) {cout << x << "\n"; return; }

using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = 1e5;
const int M = pw(16);
const long long mod = 1e9 + 7;
const int N = 2e5;
const int inf = 1e9;

template <typename T> void vout(T s){cout << s << endl;exit(0);}



int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    map <int, char> mp;

    // mp["01100001"] = 'a'; //3
    // mp["01100011"] = 'c'; //4
    // mp["01100111"] = 'g'; //5
    // mp["01101111"] = 'o'; //6

    mp[3] = 'a';
    mp[4] = 'c';
    mp[5] = 'g';
    mp[6] = 'o';

    int n; 
    cin >> n;
    string s;
    cin >> s;
    string ans;
    int rofl = 0;
    for(auto i : s) if(i == '1') rofl++;

    rofl -= 3 * n;
    if(rofl < 0) vout("NIE");    

    for(int i = 0; i < n; i++){
        int k = min(3, rofl);
        rofl -= k;
        ans += mp[3 + k];
    }

    if(rofl) vout("NIE");

    vout(ans);

    return 0;
}