#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <numeric>
#include <cassert>
#include <cmath>
using namespace std;
typedef unsigned int uint;

#define FOR(k,a,b) for(uint k(a); k < (b); ++k)
#define REP(k,a) for(uint k=0; k < (a); ++k)

int main (int argc, char** argv) {
#ifdef HOME
	freopen("in.txt","rb",stdin);
	freopen("out.txt","wb",stdout);
#endif
	int T;
	scanf("%d",&T);
	char A[1100000],B[1100000];
	while(T--)
	{
		scanf("%s",A);
		scanf("%s",B);
		if(strlen(A)!=strlen(B))
		{
			printf("Unlucky Chef\n");
			continue;
		}
		bool AZ = 0, ANZ = 0, BZ = 0, BNZ = 0;
		REP(i,strlen(A))
		{
			if(A[i] == '0')
				AZ = 1;
			else 
				ANZ = 1;
			if(B[i] == '0')
				BZ = 1;
			else
				BNZ = 1;
		}
		if( AZ != BZ || ANZ != BNZ)
		{
			printf("Unlucky Chef\n");
			continue;
		}
		int A01 = 0, A10 = 0;
		REP(i,strlen(A))
		{
			if(A[i] != B[i])
			{
				if(A[i] == '0')
					A01++;
				else
					A10++;
			}
		}
		int res = max(A01,A10);
		printf("Lucky Chef\n%d\n",res);
	}
	return 0;
}