Shakespeare's Play
Romeo and Juliet were reading Shakespeare's works. They got interested in the play Romeo and Juliet.
Since Juliet belongs to the Capulet Family, she reads only the capital case letters in the given text.
And Romeo, being a Montague, reads only the lowercase letters.
If all the letters read by Romeo and Juliet are concatenated into one sentence and contain all the letters from the Roman alphabet, they will win a trip to France. Otherwise, they will stay back in Italy.
They want to know if they have won or not, as they are busy packing their luggage. As you are their common friend, you should help them find out if they have won or not.
Given an English sentence, print "France" (without quotes) if all the Roman alphabets are read and print "Italy" (without quotes) otherwise.
For example, if they read the following sentence: abcdefghijklMNOPQRSTUVWXYZ
Juliet read: MNOPQRSTUVWXYZ
Romeo read: abcdefghijkl
Since collectively they read all the alphabet letters, you print "France"
Input format:
The input consists of a string.
Output format:
The output prints "France" or "Italy" based on the input.
Code constraints:
1 <= Length of the string <= 1000
Each character of S, s[i] ∈ (a-z, A-Z, Space)
Sample testcases:
Input 1:
The quick brown fox jumps over the lazy dog
Output 1:
France
Input 2:
The quick fox jumps over the lazy dog
Output 2:
Italy