String Similarity by Swaps

Given two strings s₁ and s₂, determine whether s₁ can be transformed into s₂ by performing any number of swaps between characters. In other words, check if the two strings are anagrams.

Important: The strings are considered similar if and only if:

• Their lengths are equal, i.e. \(|s_1| = |s_2|\).
• The multiset of characters in s₁ is equal to the multiset of characters in s₂, which can be mathematically written as: $$ sorted(s_1) = sorted(s_2) $$

Your task is to implement a program that reads two strings from standard input and outputs True if they are similar and False otherwise.

inputFormat

The input consists of a single line containing two non-empty strings separated by spaces.

For example:

abc bca

outputFormat

The output should be a single line: True if the two strings are similar (i.e. one can be transformed to the other by any number of swaps), or False otherwise.

abc bca

True