CF 112A Petya and Strings

题解：

两组字符串，比较；

规则：如果大写，换小写；

          后一个字符进行比较，A大1，B大-1，否则0；

看题长度是默认相同的，就求了长度比较；

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 stringslexicographically. 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 from1 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

aaaaaaaA

Output

0

Input

absAbz

Output

-1

Input

abcdefgAbCdEfF

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

AC代码：

#include <bits/stdc++.h>using namespace std ;int main(){char a[5000] , b[5000] ;cin>>a>>b;int flag;flag=0;int len =strlen(a);for(int i = 0 ; i<len ;i++){if(a[i]>='A'&&a[i]<='Z'){a[i]+=32;}if(b[i]>='A'&&b[i]<='Z'){b[i]+=32;}if(a[i]>b[i]){printf("1\n");flag=1;break;}else if(a[i]<b[i]){printf("-1\n");flag=1;break;}else {continue;flag=0;}}if(flag==0){printf("0\n");}return 0;}