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
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())
template<class A, class B> auto& operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}
template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for(auto e : x) o << (", ")+2*!i++ << e; return o << '}';
}
ostream& operator<<(ostream &o, string &s) {
    return o << s.data();   
}
#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n;
    string s;
    cin >> n >> s;
    vector<int> cnt(2);
    REP(i, 8 * n)
        cnt[s[i] - '0']++;
    cnt[0] -= n;
    cnt[1] -= 2 * n;
    vector<char> ans(n);
    REP(i, n) {
        int dif = cnt[0] - cnt[1];
        if (dif >= 3) {
            ans[i] = 'p';
            cnt[0] -= 4;
            cnt[1] -= 1;
        }
        else if (dif >= 1) {
            ans[i] = 'q';
            cnt[0] -= 3;
            cnt[1] -= 2;
        }
        else if (dif >= -2) {
            ans[i] = 'n';
            cnt[0] -= 2;
            cnt[1] -= 3;
        }
        else {
            ans[i] = 'o';
            cnt[0] -= 1;
            cnt[1] -= 4;
        }
    }

    if (cnt[0] < 0 || cnt[1] < 0) {
        cout << "NIE\n";
        return 0;
    }
    REP(i, n)
        cout << ans[i];
    cout << '\n';

    return 0;
}