## Problem Description

A number is considered lucky if it can be represented as a sum of a non-negative number of 4s and a non-negative number of 7s. For example, 18 is lucky because 18 = 7 + 7 + 4. Given *T* numbers in an array *A*, tell me whether each of them is lucky.

## Input

The first line of input will contain one integer, *T*.

The second line of input will contain *T* integers, representing the array *A*.

## Output

The output should contain *T* lines with *T* strings, either "Lucky" or "Unlucky", with the *i*-th line representing the luckiness of the *i*-th number.

## Limits

For all subtasks: 1 ≤ T ≤ 10^{5}.

Subtask 1 (12%): 1 ≤ T, A_{i} ≤ 100.

Subtask 2 (37%): 1 ≤ A_{i} ≤ 10^{6}.

Subtask 3 (20%): 1 ≤ A_{i} ≤ 10^{9}.

Subtask 4 (31%): 1 ≤ A_{i} ≤ 10^{18}.

Subtask 5 (0%): Sample Testcases.

## Sample Input 1

4
1 4 11 17

## Sample Output 1

Unlucky
Lucky
Lucky
Unlucky