Maximum Number

Given an integer A that contains n > 1 digits. You are asked to remove exactly one digit to make the result number is divisible by 6, also make it biggest possible. Input The first line contains an integer T, denotes the number of test cases. Each test case is described by an integer A in a single line. Output Each test case, output the answer on a single line (it's allowed to delete a dig