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

#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
char lett[4]={'a','c','m','o'};
int main()
{
   int n;
   cin>>n;
    char znak; int ilosc=0;
  for(int i=0; i<8*n; i++)
  {
      cin>>znak;
      if(znak=='1') ilosc++;
  }
  int pierw=0,ost=0;
  if(ilosc%n!=0) pierw=1;
  pierw+=ilosc/n; ost+=ilosc/n;
  const int mini=3; const int maxi=6;
  if(!(mini<= pierw and pierw<=maxi) or !(mini<=ost and ost<=maxi))
  {
      cout<<"NIE"; return 0;
  }
  int c=ilosc/n;
  for(int i=0; i<ilosc%n; i++) cout<<lett[c+1-3];
  for(int i=0; i<n-(ilosc%n); i++) cout<<lett[c-3];
  return 0;
}