2794. Petya and Strings

2794. 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.

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.

Examples

Input

　　aaaa
　　aaaA

Output

　　0

Input

　　abs
　　Abz

Output

　　-1

Input

　　abcdefg
　　AbCdEfF

Output

　　1

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

---

说明：此题看上去很高大上，其实很简单，就是比较两个字符串的大小（忽略大小写），如果字符串1大于字符串2，输出1；如果字符串1小于字符串2，输入-1；如果相等，则输入0。

import java.util.Scanner;

public class Test2794 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str1 = sc.nextLine();
        String str2 = sc.nextLine();

        if (str1.compareToIgnoreCase(str2) > 0) {
            System.out.println(1);
        } else if (str1.compareToIgnoreCase(str2) < 0) {
            System.out.println(-1);
        } else {
            System.out.println(0);
        }

        sc.close();
    }
}