Numerology#2348
Neville poured the matchsticks onto the table, forming a number with digits that seemed ominous. To change this forecast, Neville needs to transform the number by moving just one matchstick. The goal is to create the largest possible number to reduce the chance of an undesirable event.
The digits formed by the matchsticks resemble those on Muggle calculators:
Write a program that takes the number formed by the matchsticks and outputs the new number after moving one matchstick.
The input consists of a single integer (1 \leq N < 10^9).
Output the new number (K > 0, K \neq N; if there are multiple possibilities, choose the largest one) or the message FAIL if it is impossible to change the number by moving one matchstick.
Example 1