Codeforces Beta Round 85 (Div. 2 Only)
A
Petya and Strings
Codeforces
800
原题
←B →
翻译中…

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.

翻译中…

Input

翻译中…

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.

翻译中…

Output

翻译中…

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.

翻译中…

Note

翻译中…

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
翻译中…

样例

Input #1
aaaa
aaaA
Output #1
0
InputCopy OutputCopy
Input #2
abs
Abz
Output #2
-1
InputCopy OutputCopy
Input #3
abcdefg
AbCdEfF
Output #3
1
InputCopy OutputCopy
题目信息
题号
112A
时间限制
2 s
内存限制
256 MB
标签
模拟
字符串

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。