Matthew has purchased a new game and isn't feeling like completing his home work his teacher gave it to him. Can you help Matthew to complete his home work ?
The homework is :
Given an integer $n$
, find the minimum number of digits which needs to be removed from $n$
so that $n$
becomes a perfect square without leading zeros. If there is no possible solution print $-1$
.
First line contains an integer $t$
$(1 \leq t \leq 50)$
, the number of test cases.
Following $t$
lines, contain an integer $n$
$(1 \leq n \leq 10^{10})$
.
Print $t$
lines with answer for each $n$
.
Input | Output |
---|---|
3 6434 625 333 | 2 0 -1 |