CF112A.Petya and Strings

Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.

小佩佳喜欢礼物。他妈妈在他生日时给他买了两个长度相同的字符串。这两个字符串由大写和小写的拉丁字母组成。现在佩佳想要对这两个字符串进行字典序比较。字母的大小写不重要，即大写字母被认为等价于对应的小写字母。请帮助佩佳完成该比较。

Each of the first two lines contains a bought string. The strings' lengths range from 1 to 100 inclusive. It is guaranteed that the strings are of the same length and also consist of uppercase and lowercase Latin letters.

前两行每行包含一个购买的字符串。每个字符串的长度在 1 到 100 之间（含端点）。保证两个字符串长度相等，且均由大写和小写的拉丁字母组成。

If the first string is less than the second one, print "-1". If the second string is less than the first one, print "1". If the strings are equal, print "0". Note that the letters' case is not taken into consideration when the strings are compared.

如果第一个字符串小于第二个字符串，则输出“-1”；如果第二个字符串小于第一个字符串，则输出“1”；如果两个字符串相等，则输出“0”。注意：比较字符串时忽略字母的大小写。

If you want more formal information about the lexicographical order (also known as the "dictionary order" or "alphabetical order"), you can visit the following site:

• http://en.wikipedia.org/wiki/Lexicographical_order

如果你想了解有关字典序（也称为“词典序”或“字母序”）的更正式信息，可以访问以下网站：

• http://en.wikipedia.org/wiki/Lexicographical_order