"Alfred" Rebel's cute but innovative personal butler bot, decides to play a game to give us some relief from being too awesome in our day to day operations. He would be giving us two strings and would ask us to make them identical, using the minimum actions possible of the following types:

1. Select any character in any of the strings and repeat it (add another instance of this character exactly after it). For example, in a single move "abc" could be changed to "abbc" (by repeating the character 'b').
2. Select any two adjacent and identical characters in any of the strings, and delete one of them.

For example, in a single move, "abbc" could be changed to "abc" (delete one of the 'b' characters), but can't convert it to "bbc".
The $$2$$ actions are independent i.e. it's not necessary that an act of the first type should be followed by an action of the second type (or vice versa).
We decided to beat Alfred by writing a program to find if it is possible to make the given strings identical and to find the minimum number of moves if it is possible or print "Not possible" if the solution is not possible to derive.

Write a function:

function solution (string A, string B) {} that given 2 strings A and B, returns the minimum no. of tasks required to do so and "Not possible" if the solution is not possible to derive.

Input Format
Input would be the 2 strings in consideration one in each line. Each string is non-empty and will consist of lower case English characters only, from 'a' to 'z'.

Output Format 
If the two strings could be made identical print the minimum no. of tasks required to do so and "Not possible" if the solution is not possible to derive.

Constraints
\(1 ≤ length \; of \; each \; string ≤ 100\)