There are some cards which, instead of numbers, are marked as lowercase english alphabets or a Joker marked as ‘$’

You are given 2 decks of cards represented by two strings S1 and S2

You can replace a Joker (card marked as ‘$’) by any of the cards marked ‘c’, ‘o’, ‘d’ or ‘e’

You need to make those strings equal only by replacing the joker and count the number of replacements done

If the strings cannot be made equal, print -1

NOTE: You cannot add or remove any card except Joker (which can only be replaced by another card)

Input

• First line contains an integer T, the number of testcases.

• Next T lines contain two strings S1 and S2 separated by space.

Output

• T lines, each with single integer representing the count of replacements done for each testcase

Constraints

• $1 \leq T \leq 100$

• $0 ≤ |S1|, |S2| ≤ 10^4$

• $|S1| = |S2|$