For this Question: They say friendship is greater than love. Why not play the famous game "FLAMES".
The rules are super simple. Given two strings (all lowercase), remove all the letters that are common to both the strings from both the strings. You cannot erase a character in first string whichever corresponding same character in other string not exist.
For example, in the case
String 1: saumya
String 2: ansh
You can remove only 1 'a' and 1 's' from both the strings.
Remaining strings are:
String 1: umya
String 2: nh

Now all you need to do is find the sum of the remaining strings length % 6.

Output:
If obtained value is 1, output "Friends"
If obtained value is 2, output "Love"
If obtained value is 3, output "Affection"
If obtained value is 4, output "Marriage"
If obtained value is 5, output "Enemy"
If obtained value is 0, output "Siblings"You will be given two strings on different lines.

Constraints
1 <= Length of both the strings <= 100000Output a single string, the result of FLAMES test.Sample Input:-
saumya
ansh

Sample Output:-
Siblings

Explanation:-
after deleting characters :-
str1 = umya
str2 = nh
sum = 4+2
sum%6=0
, I have written this Solution Code: 























































import java.io.*;
import java.util.*;

class Main {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String str1 = br.readLine();
		String str2 = br.readLine();


		countCommonCharacters(str1, str2);
	}















	static void countCommonCharacters(String s1, String s2) {
		int[] arr1 = new int[26];
		int[] arr2 = new int[26];

		for (int i = 0; i < s1.length(); i++)
			arr1[s1.codePointAt(i) - 97]++;

		for (int i = 0; i < s2.length(); i++)
			arr2[s2.codePointAt(i) - 97]++;

		int lenToCut = 0;
		for (int i = 0; i < 26; i++) {
			int leastOccurrence = Math.min(arr1[i], arr2[i]);
			lenToCut += (2 * leastOccurrence);
		}

		System.out.println(findRelation((s1.length() + s2.length() - lenToCut) % 6));
	}
	static String findRelation(int value) {
		switch (value) {
			case 1:
				return "Friends";
			case 2:
				return "Love";
			case 3:
				return "Affection";
			case 4:
				return "Marriage";
			case 5:
				return "Enemy";
			default:
				return "Siblings";
		}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?