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>
using namespace std;
#define IOS                       \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define repV(i, a, n) for (int i = n; i >= a; i--)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
constexpr int M = 1e5 + 5;
int n, ans;
ll mini, sum;
string s;

void solve()
{
    cin >> n;
    cin >> s;
    s = " " + s;
    for (auto x : s)
        if (x == '1')
            sum++;
    mini = n * 3;
    if (sum < n * 3 || sum > n * 6)
    {
        cout << "NIE\n";
        return;
    }
    while (sum != mini)
    {
        ++ans;

        if (mini + 3 <= sum)
        {
            mini += 3;
            cout << 'o';
            continue;
        }
        if (mini + 2 <= sum)
        {
            mini += 2;
            cout << 'g';
            continue;
        }
        if (mini + 1 <= sum)
        {
            mini += 1;
            cout << 'e';
            continue;
        }
        cout << 'a';
    }
    while (ans != n)
    {
        cout << 'a';
        ans++;
    }
}

int main()
{
    IOS
    solve();
}