LOL

A word made of lowercase English letters is given. You want to edit it so that it contains lol as a contiguous substring.

One operation is one of the following.

• Insert one lowercase English letter at any position.
• Replace one existing letter with another lowercase English letter.
• Delete one existing letter.

For each word, find the minimum number of operations needed.

The first line contains the number of test cases $T$ ($1 \le T \le 100$).

Each of the next $T$ lines contains one word. A word is made of lowercase English letters only and its length is at most $50$.

For each word, print on its own line the minimum number of operations that make lol a substring, in the order the words are given.