CodeForces - 112A 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 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.

Example

Input

aaaa
aaaA

Output

0

Input

abs
Abz

Output

-1

Input

abcdefg
AbCdEfF

Output

1

逐位比较

代码如下：

#include<stdio.h>
int main()
{
	char a[101],b[101];
	scanf("%s%s",a,b);
	int i;
	for(i=0;a[i]!='\0';i++)
	{
		if(a[i]<='Z'&&a[i]>='A') a[i]+=32;
		if(b[i]<='Z'&&b[i]>='A') b[i]+=32;
		if(a[i]>b[i])
		{
			printf("1\n");
			break;
		}
		else if(a[i]<b[i])
		{
			printf("-1\n");
			break;
		}
	}
	if(a[i]=='\0') printf("0\n");
	return 0;
}