Description
You are given two strings s, t of same length, you need to find the reorder distance between them.
Let us define the reorder distance between two strings of same length to be the minimum number of positions that has different character after reordering the strings (that is, arranging the characters in the string).
For example, the reorder distance between "yajusenpai" and "pineapples" is 4, as we can reorder the first string into "pineayajus". In this way, only four position of these two strings has different character (position 6 to 9).
For the formal definition, let [n] be the set {1, 2, 3, ..., n}, where n is the length of strings, and F be the set of all bijections between [n] and [n]. Then the reorder distance of s, t, denoted as d(s, t), is:
Input
The first line is the string s, and the second line is the string t.
It is guranteed that these two string are of same length, and the length will not exceed 105. Also, the input strings only contain lowercase english letters.
Output
Output the reorder distance between two strings in one line.