Given two strings s1 and s2, we want to visualize how different the two strings are.
We will only take into account the *lowercase* letters (a to z).
First let us count the frequency of each *lowercase* letters in s1 and s2.

`s1 = "A aaaa bb c"`

`s2 = "& aaa bbb c d"`

`s1 has 4 'a', 2 'b', 1 'c'`

`s2 has 3 'a', 3 'b', 1 'c', 1 'd'`

So the maximum for 'a' in s1 and s2 is 4 from s1; the maximum for 'b' is 3 from s2.
In the following we will not consider letters when the maximum of their occurrences
is less than or equal to 1.

We can resume the differences between s1 and s2 in the following string:
`"1:aaaa/2:bbb"`
where `1` in `1:aaaa` stands for string s1 and `aaaa` because the maximum for `a` is 4.
In the same manner `2:bbb` stands for string s2 and `bbb` because the maximum for `b` is 3.

The task is to produce a string in which each *lowercase* letters of s1 or s2 appears as many times as
its maximum if this maximum is *strictly greater than 1*; these letters will be prefixed by the 
number of the string where they appear with their maximum value and `:`. 
If the maximum is in s1 as well as in s2 the prefix is `=:`.

In the result, substrings (a substring is for example 2:nnnnn or 1:hhh; it contains the prefix) will be in decreasing order of their length and when they have the same length sorted in ascending lexicographic order (letters and digits - more precisely sorted by codepoint); the different groups will be separated by '/'. See examples and "Example Tests".

Hopefully other examples can make this clearer.

```
s1 = "my&friend&Paul has heavy hats! &"
s2 = "my friend John has many many friends &"
mix(s1, s2) --> "2:nnnnn/1:aaaa/1:hhh/2:mmm/2:yyy/2:dd/2:ff/2:ii/2:rr/=:ee/=:ss"

s1 = "mmmmm m nnnnn y&friend&Paul has heavy hats! &"
s2 = "my frie n d Joh n has ma n y ma n y frie n ds n&"
mix(s1, s2) --> "1:mmmmmm/=:nnnnnn/1:aaaa/1:hhh/2:yyy/2:dd/2:ff/2:ii/2:rr/=:ee/=:ss"

s1="Are the kids at home? aaaaa fffff"
s2="Yes they are here! aaaaa fffff"
mix(s1, s2) --> "=:aaaaaa/2:eeeee/=:fffff/1:tt/2:rr/=:hh"
```
# Note for Swift, R, PowerShell
The prefix `=:` is replaced by `E:`
``` 
s1 = "mmmmm m nnnnn y&friend&Paul has heavy hats! &"
s2 = "my frie n d Joh n has ma n y ma n y frie n ds n&"
mix(s1, s2) --> "1:mmmmmm/E:nnnnnn/1:aaaa/1:hhh/2:yyy/2:dd/2:ff/2:ii/2:rr/E:ee/E:ss"
```

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'def filter_lowercase(character_in_s):\n    lowercase_alphabet=["a","b","c","d","e","f","g","h","i","j","k","l","m",\n    "n","o","p","q","r","s","t","u","v","w","x","y","z"]\n\n    if(character_in_s in lowercase_alphabet):\n        return True\n    else:\n        return False\n\ndef sort_mix(a):\n    return len(a)\n\ndef order_alphabetically_ascendent(elem):\n    if elem[:1]=="=":\n        return 2\n    elif elem[:1]=="1":\n        return 0\n    elif elem[:1]=="2":\n        return 1\n\n\n\ndef mix(s1, s2):\n    lowercase_alphabet=["a","b","c","d","e","f","g","h","i","j","k","l","m",\n    "n","o","p","q","r","s","t","u","v","w","x","y","z"]\n    characters_in_s1=[]\n    characters_in_s2=[]\n\n    amount_of_each_letter_in_s1=[]\n    amount_of_each_letter_in_s2=[]\n    where_is_maximum=[]\n    maximum=[]\n\n    letters_used_with_prefix = []\n    string_to_return=""\n\n    #filter variables\n    different_lengths=[]\n    array_of_letters_with_the_same_length=[]\n\n\n\n    for character in s1:\n        characters_in_s1.append(character)\n    for character in s2:\n        characters_in_s2.append(character)\n\n    lowercase_letters_in_s1=list(filter(filter_lowercase, characters_in_s1))\n    lowercase_letters_in_s2=list(filter(filter_lowercase, characters_in_s2))\n#Final parte 1: now I got two lists with the lowercase letters of each string\n\n#2-para cada letra del abecedario(array), comprueba cuentas hay en cada string. consigue el máximo, y de qué string(1,2). Ten variables sobre cuantas veces aparece la letra en cada string\n\n\n    for alphabet_letter in lowercase_alphabet:\n        lowercase_letters_in_s=[]\n        i = len(amount_of_each_letter_in_s1)\n        string_to_append=""\n\n        amount_of_each_letter_in_s1.append(lowercase_letters_in_s1.count(alphabet_letter))\n        lowercase_letters_in_s.append(lowercase_letters_in_s1.count(alphabet_letter))\n\n        amount_of_each_letter_in_s2.append(lowercase_letters_in_s2.count(alphabet_letter))\n        lowercase_letters_in_s.append(lowercase_letters_in_s2.count(alphabet_letter))\n\n        maximum.append(max(lowercase_letters_in_s))\n\n        if lowercase_letters_in_s2.count(alphabet_letter)==lowercase_letters_in_s1.count(alphabet_letter):\n            where_is_maximum.append("b")\n        elif lowercase_letters_in_s1.count(alphabet_letter)>lowercase_letters_in_s2.count(alphabet_letter):\n            where_is_maximum.append("1")\n        elif lowercase_letters_in_s2.count(alphabet_letter)>lowercase_letters_in_s1.count(alphabet_letter):\n            where_is_maximum.append("2")\n\n        if maximum[i] >1: #puede dar problemas la condicion del and\n            if where_is_maximum[i] == "b" :\n                string_to_append = "=:" + lowercase_alphabet[i]*maximum[i]\n            elif where_is_maximum[i] != "b":\n                string_to_append += str(where_is_maximum[i]) + ":" + lowercase_alphabet[i]*maximum[i]\n\n\n            letters_used_with_prefix.append(string_to_append)\n\n#1: longitud decreciente 2: numero más chico ascendente 3: letra más chica ascendente\n\n\n\n    letters_used_with_prefix=sorted(letters_used_with_prefix,key=lambda conjunto: (len(conjunto)), reverse=True)\n    #letters_used_with_prefix=sorted(letters_used_with_prefix, key=order_alphabetically_ascendent)\n\n\n\n    for string in letters_used_with_prefix:\n        if len(string) not in different_lengths:\n            different_lengths.append(len(string))\n\n    length = len(different_lengths)\n\n    while length>0:\n        letters_with_the_same_length=[]\n        for letter_used_with_prefix in letters_used_with_prefix:\n            if len(letter_used_with_prefix)==different_lengths[length-1]:\n                letters_with_the_same_length.append(letter_used_with_prefix)\n        letters_with_the_same_length=sorted(letters_with_the_same_length, key=order_alphabetically_ascendent)\n        array_of_letters_with_the_same_length.append(letters_with_the_same_length)\n\n        length=length-1\n\n    array_of_letters_with_the_same_length.reverse()\n\n\n\n    for subarray in array_of_letters_with_the_same_length:\n        for item in subarray:\n            string_to_return+=item+"/"\n\n    string_to_return=string_to_return[:-1]\n    return(string_to_return)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'mix'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 10293