#include<bits/stdc++.h>
#define DIST(x1,x2, y1, y2) (((x1-x2)*(x1-x2))+((y1-y2)*(y1-y2)))
#define DIST3D(x1,x2, y1, y2, z1, z2) (((x1-x2)*(x1-x2))+((y1-y2)*(y1-y2)) + ((z1-z2)*(z1-z2)))
#define CLR(a) a.clear()
#define VCLR(a, n) for(int i=0; i<=n+3; i++) a[i].clear()
#define SIZE(a) a.size()
#define ERASE(a, b) memset(a, b, sizeof a)
#define PB(a, b) a.push_back(b)
#define PB2(a,i,b) a[i].push_back(b)
#define LL long long
#define ULL unsigned long long
#define DBG cout<<"I Am Here"<<endl
#define DBGA(a) cout<<a<<endl
#define DBGI(b,a) cout<<b<<' '<<a<<endl
#define DBGL(i,s,e,b) or(int i=s; i<=e; i++) cout<<b<<endl
#define INF 1e9
#define INV 1e-6
#define sc(a) scanf("%I64d", &a)
#define SC(a) scanf("%lld", &a)
#define pr(a) printf("%I64d\n", a)
#define PR(a) printf("%lld\n", a)
#define si(a) scanf("%d", &a)
#define pii pair<int,int>
#define PII pair<LL,LL>
#define MAX 600005
#define CASE(i) printf("Case %d: ", i);
#define PI acos(-1)
#define piis pair<int, string>
#define fast1 ios_base::sync_with_stdio(false);
#define fast2 cin.tie(0)

using namespace std;

LL MOD = 1000000007;

LL bigmod(LL a, LL b){
    LL x = 1, y = a%MOD;
    while(b > 0) {
        if(b%2 == 1) {
            x=(x*y);
            if(x>MOD) x%=MOD;
        }
        y = (y*y);
        if(y>MOD) y%=MOD;
        b /= 2;
    }
    return x;
}

LL MODINVERSE(LL a){
    return bigmod(a, MOD-2);
}

//LL dp[900][1000];
//LL NCR(int n, int r)
//{
//    if(r==1) return n;
//    else if(n==r) return 1;
//    else
//    {
//        if(dp[n][r]!=-1) return dp[n][r];
//        else
//        {
//            dp[n][r]=NCR(n-1,r) + NCR(n-1,r-1);
//            return dp[n][r];
//        }
//    }
//}

bool flag;

struct node{
    bool endmark;
    node *next[27];
    node()
    {
        endmark = false;
        for(int i=0; i<26; i++)  next[i] = NULL;
    }
}*root;

void INSERT(string str, int len)
{
    node *curr = root;
    for(int i=0; i<len; i++)
    {
        int idx = str[i] - 'a';
        if(curr->next[idx]==NULL)
            curr->next[idx] = new node();
        curr = curr->next[idx];
    }
    curr->endmark = true;
}

bool SEARCH(string str, int len)
{
    flag = false;
    node *curr = root;
    for(int i=0; i<len; i++)
    {
        int idx = str[i] - 'a';
        if(curr->next[idx]==NULL) return false;
        curr = curr->next[idx];
        if(curr->endmark==true && i+1!=len) flag = true;
    }
    return curr->endmark;
}

void DELETE(node *curr)
{
    for(int i=0; i<26; i++)
        if(curr->next[i]) DELETE(curr->next[i]);
    delete (curr);
}

string arr[100005];

int main()
{
    int n;
    while(scanf("%d", &n)&& n>0){
        root = new node();
        map<string, int>mymap;
        mymap.clear();
        bool check = false;

        for(int i=0; i<n; i++)
        {
            string str;
            cin>>str;
            arr[i] = str;
            if(mymap[str]>0) check = true;
            mymap[str]++;
            INSERT(str, str.size());
        }
        if(check){
            printf("Conjunto Ruim\n");
            continue;
        }
        bool found = false;
        for(int i=0; i<n; i++)
        {
            string str;
            str = arr[i];
            SEARCH(str, str.size());
            if(flag)
                found = true;
        }
        if(!found)
            puts("Conjunto Bom");
        else
            puts("Conjunto Ruim");
        DELETE(root);
    }
    return 0;
}