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
74
75
76
77
78
79
80
81
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
using namespace std;
int n,k;
vector <int> v;

int main(){
	scanf("%d", &n);
	int zero = 0;
	int one = 0;

	// cout<<"fin1" <<"\n";
	string ans = "";
	// cout<<"fi2"<<"\n";;
	string s = "";
	// cout<<"faaaaa"<<"\n";;
	cin>>s;

	// cout<<"fin";
	// cout<<s;

	for (int i =0; i < s.size(); i++){
		// cout<<s[i]<<" ";
		if ( s[i] != '1' ){
			zero++;
		}
		else{
			one++;
		}
	}


	while ( zero + one >= 8 ){
		// cout<<zero<<" "<< one<<"\n";
		if ( one < 3  || zero < 2){
			printf("NIE\n");
			return 0;
		}
		int diff = zero - one;
		
		if ( diff > 0){
			zero -= 5;
			one -= 3;
			ans += "a";
			continue;
		}

		if ( diff == 0 ){
				zero -= 4;
				one -= 4;
				ans += "c";
				continue;
			}


		if ( diff <= -4 ){
				zero -= 2;
				one -= 6;
				ans += "o";
				continue;
			}

		if (diff <= -2){
			
			zero -= 3;
			one -= 5;
			ans += "g";
			continue;

		}
	}


	
	cout<<ans<<"\n";


}