eolymp
bolt
Try our new interface for solving problems
Problems

Strings with Same Letters

Strings with Same Letters

Time limit 1 second
Memory limit 64 MiB

A professor assigned a program to his class for which the output is a string of lower-case letters. Unfortunately, he did not specify an ordering of the characters in the string, so he is having difficulty grading student submissions. Because of that, he has requested that ICPC teams help by writing a program that inputs pairs of strings of lower-case letters and determines whether or not the strings have the same letters, though possibly in different orders.

Note that repeated letters are important; the string "abc" and "aabbbcccc" are not viewed as having the same letters since the second one has more copies of each letter.

Input data

Input to be processed will be pairs of lines containing nonempty strings of lower-case letters. All input will be valid until the end of file indicator. End of file will be signaled by two lines that contain just the word "END" in upper case. No input line will be longer than 1000 characters.

Output data

Report whether pairs of strings have the same letters or not. Follow the format exactly: "Case", a space, the case number, a colon and one space, and the result given as "same" or "different" (lower-case, no punctuation). Do not print any trailing spaces.

Examples

Input example #1
testing
intestg
abc
aabbbcccc
abcabcbcc
aabbbcccc
abc
xyz
END
END
Output example #1
Case 1: same
Case 2: different
Case 3: same
Case 4: different
Source ACM ICPC NCNA Programming Contest - November 7, 2013