Today is Chef's birthday. His mom decided to surprise him with a truly fantastic gift: his favourite binary string B. But, unfortunately, all the stocks of binary string B have been sold out, and only a binary string A (A ≠ B) is available in the market.
She purchases the string A and tries to convert it to string B by applying any of following three operations zero or more times.
AND Operation:
She will choose a pair of indices i and j such that i != j and perform following sequence of operations.

-  result = Ai & Aj 
-  Ai = result & Ai 
-  Aj = result & Aj 

OR Operation:
She will choose a pair of indices i and j such that i != j and perform following sequence of operations.

-  result = Ai | Aj 
-  Ai = result | Ai 
-  Aj = result | Aj 

XOR Operation:
She will choose a pair of indices i and j such that i != j and perform following sequence of operations.

-  result = Ai ^ Aj 
-  Ai = result ^ Ai 
-  Aj = result ^ Aj 

Chef's mom is eagerly waiting to surprise him with his favourite gift and therefore, she wants to convert string A to string B as fast as possible. Can you please help her by telling her the minimum number of operations she will require? If it is impossible to do so, then let Chef's mom know about it.

-----Input-----
First line of input contains a single integer T denoting the number of test cases. T test cases follow.
First line of each test case, will contain binary string A.
Second line of each test case, will contain binary string B.

-----Output-----
For each test case, Print "Lucky Chef" (without quotes) in first line and minimum number of operations required to convert string A to sting B in second line if conversion is possible. Print "Unlucky Chef" (without quotes) in a new line otherwise.

-----Constraints-----
- 1 ≤ T ≤ 105
- 1 ≤ |A| ≤ 106
- 1 ≤ |B| ≤ 106
- A != B
- |A| = |B|
- sum of |A| over all test cases does not exceed 106
- sum of |B| over all test cases does not exceed 106

-----Subtasks-----
-  Subtask #1 (40 points) : Sum of |A| & |B| over all test cases does not exceed 103
-  Subtask #2 (60 points) : Sum of |A| & |B| over all test cases does not exceed 106

-----Example-----
Input
2
101
010
1111
1010
Output
Lucky Chef
2
Unlucky Chef

-----Explanation-----
Example case 1.
- Applying XOR operation with indices i = 1 and j = 2. Resulting string will be 011.
- Then, Applying AND operation with indices i = 1 and j = 3. Resulting string will be 010.

Example case 2.
- It is impossible to convert string A to string B.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "# cook your dish here\n\nt = int(input())\nwhile t:\n A = input()\n B = input()\n mp1 = 0\n p1 = 0\n mp0 = 0\n p0 = 0\n for i in range(len(B)):\n  if A[i]==B[i] and B[i]=='1':\n   p1 += 1\n  elif A[i]==B[i] and B[i]=='0':\n   p0 += 1\n  elif A[i]!=B[i] and B[i]=='1':\n   mp0 += 1\n  else:\n   mp1 += 1\n #if A==B:\n  #   con = True\n  #  op = 0\n if mp0+p0==len(A) or mp1+p1==len(A):\n  con = False\n elif mp1+p0>=mp0+p0:\n  con = True\n  op = mp1-mp0\n  mp1 -= op\n  op += mp1\n else:\n  con = True\n  op = mp0-mp1\n  mp0 -= op\n  op += mp0\n if con:\n  print('Lucky Chef')\n  print(op)\n else:\n  print('Unlucky Chef')\n t -= 1\n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13351