Larry is having trouble making a problem for the DMOPC, and
[REDACTED] is threatening to savage him, so he decides that he will make a nice string manipulation problem.
Given string ~A~, determine if it is possible to make string ~B~ by changing exactly one character of string ~A~ to a different character. Both strings are of the same length, and will only consist of alphanumeric characters.
The first line of input will be string ~A~ (~1 \le |A| \le 1000~).
The next line of input will be string ~B~ (~|A| = |B|~).
LARRY IS SAVED! if it is possible to make string ~B~ from string ~A~, given the restrictions.
LARRY IS DEAD! if it is not possible, given the restrictions.
LARRY IS SAVED!