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
73
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int INF=INT_MAX;
const int MAXN=800000+5;

int n;
char c[MAXN];
char z[8];
int main() {
    ios_base::sync_with_stdio(0);
    
    z[3] = 'a';
    z[4] = 'c';
    z[5] = 'g';
    z[6] = 'o';
    
    SI(n);
    scanf(" ");
    fread(c, sizeof(c[0]), n*8, stdin);
    int ones = 0;
    REP(i, 8*n) {
        if (c[i] == '1') {
            ones++;
        }
    }
    
    int character = ones/n;
    int rest = ones - character*n;
    if (character < 3 || (character == 6 && rest > 0) || character > 6) {
        printf("NIE");
        
    } else {
        REP(i, rest) {
            printf("%c", z[character + 1]);
        }
        REP(i, n-rest) {
            printf("%c", z[character]);
        }
    }
    printf("\n");
    return 0;
}