#include<cstdio>

#include<algorithm>

#include<cstring>

using namespace std;

typedef long long ll;

char str[];

int cnt[];

bool cmp(int a,int  b) { return cnt[a]>cnt[b] || ( cnt[a] == cnt[b] && a > b ); }

int main()

{

    int T;

    scanf("%d",&T);getchar();

    for(int k = ; k <= T; k++){

        memset(cnt,,sizeof(cnt));

        while(~scanf("%s",str)&&(*str)!='*'){

            int len = strlen(str);

            for(int i = ; i < len; i++){

                char ch = str[i];

                if('a'<=ch&&ch<='z'){

                    cnt[ch-'a']++;

                }else

                if('A'<=ch&&ch<='Z'){

                    cnt[ch-'A']++;

                }

            }

        }

        int r[];

        for(int i = ; i < ; i++) { r[i] = i; }

        sort(r,r+,cmp);

        int sum = ;

        for(int i = ; i < ; i++) {

            if(cnt[r[i]])

            sum += r[i];

        }

        printf("Case %d: %s\n",k,sum>?"Effective":"Ineffective");

    }

    return ;

}