A - Arcade Game（概率）

Arcade mall is a new modern mall. It has a new hammer game called "Arcade Game". In this game you're presented with a number n which is hanged on a wall on top of a long vertical tube, at the bottom of the tube there is a button that you should hit with your hammer.

When you hit the button with all your force (as you always do), a ball is pushed all over the tube and hit the number n. The number n flies in the air and it's digits fall back in any random permutation with uniform probability.

If the new number formed is less than or equal to the previous number, the game ends and you lose what ever the new number is. Otherwise (if the number is greater than the previous number), you are still in the game and you should hit the button again.

You win if the new number formed is greater than the previous number and it is equal to the greatest possible permutation number.

Can you compute the probability of winning?

Input

The first line of the input contains the number of test cases T. Following that there are T lines represents T test cases. In each line, there is a single integer (1 ≤ n ≤ 109) the target number. The digits of n are all unique, which means that any 2 digits of n are different.

Output

For each test case, print one line containing the answer. Print the answer rounded to exactly 9 decimal digits.

Examples

Input

3
952
925
592

Output

0.000000000
0.166666667
0.194444444

Note

In the first test case, the answer is 0 because 952 is greater than all 2,5 and 9 permutations so you can't win, whatever you do.

In the second test case, the answer is 0.166666667 because you may win by getting number 952 with probability 1/6.

In the third test case the answer is 0.194444444 because you may win by getting number 952 in round1 with probability 1/6 or you can win by getting number 925 in round 1 and then 952 in round 2 with probability 1/6 * 1/6.

先说明两个函数：

1. prev_permutation(a.begin(),a.end())，如果当前a序列不是最小的序列返回1，否则返回0，使得a序列变成小于当前a序列的最小的序列。next

2. next_permutation(a.begin(),a.end())，如果当前a序列不是最大的序列返回1，否则返回0，使得a序列变成大于当前a序列的最小的序列。

题意：

T组样例，每组样例给你一个数，你都有一次机会：打乱当前a的序列，等概率地找到另一个序列，如果这个序列比当前a序列大，则继续进行，直到出现最大序列。你获胜地条件就是找到那个最大序列，问你有多大概率能找到那个序列。如果当前是最大序列则你没有机会去找到最大序列。

思路：可以根据 next_permutation（）函数找到有多少个大于当前序列的个数，得出个数后，因为一次找到最大的序列为1/f[n],f[i]为i的阶乘，两次找到最大序列等同于第一次找到第二大序列1/f[n]*1/f[n]第二次找到最大序列'....。

代码：

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e3+100;
int a[11];
typedef long long ll;
double f[11];
void init()
{
    f[0]=1;
    for(ll i=1;i<=10;i++)
    {
        f[i]=f[i-1]*i;
    }
}
int main()
{
    int T;
    cin>>T;
    init();
    while(T--)
    {
        string s;
        cin>>s;
        for(int i=0;i<s.size();i++)
        {
            a[i]=s[i]-'0';
        }
        double ans=0;
        double now=1.0;
        ll sum=0;
        while(next_permutation(a,a+s.size()))
        {
            sum++;
        }
//        if(sum) cout<<sum<<endl;
        for(int i=0;i<sum;i++)
        {
            ans=(now/f[s.size()]);
            now+=ans;
        }
        printf("%.9lf\n",ans);
    }
    return 0;
}