## Petya and Strings in java

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 case of the letter 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 length of string 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 case of the letter is not taken into consideration when the strings are compared.

aaaa

aaaA

0

abs

Abz

-1

abcdefg

AbCdEfF

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

## Solution:–

```import java.util.*;
import java.lang.*;
import java.io.*;

public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner input = new Scanner(System.in);
String word1 = input.next();
String word2 = input.next();

word1 = word1.toLowerCase();
word2 = word2.toLowerCase();

int result = word1.compareTo(word2);
if(result > 0)
{
result = 1;
}
else if(result < 0)
{
result = -1;
}
System.out.println(result);
}
}

//https://www.javatpoint.com/java-string-compareto```