Promblem——112A. Petya and Strings——Codeforces

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

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<assert.h>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
#define maxn 2147483648+30
using namespace std;
ll gar(ll a,ll b){//最大公约数 
return b==0?a:gar(b,a%b);
}

int main(){
	string s1,s2;
	while(cin>>s1>>s2){
		for(int i=0;i<s1.length();i++){
			if(s1[i]>='A'&&s1[i]<='Z')s1[i]+=32;
		}
		for(int i=0;i<s2.length();i++){
			if(s2[i]>='A'&&s2[i]<='Z')s2[i]+=32;
		}
		if(s1==s2)cout<<"0"<<endl;
		else if(s1<s2)cout<<"-1"<<endl;
		else if(s1>s2)cout<<"1"<<endl;
	}
	return 0;
}