//#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <stdio.h>
#include <queue>
#include <stack>;
#include <map>
#include <set>
#include <string.h>
#include <vector>
#define ME(x , y) memset(x , y , sizeof(x))
#define SF(n) scanf("%d" , &n)
#define rep(i , n) for(int i = 0 ; i < n ; i ++)
#define INF  0x3f3f3f3f
#define mod 1000000007
using namespace std;
typedef long long ll ;
ll a[59];


int main()
{
    int t ;
    a[2] = 1 ;
    a[3] = 2 ;
    for(int i = 4 ; i <= 20 ; i++)
        a[i] = (i-1)*(a[i-1] + a[i-2]);
    scanf("%d" , &t);
    while(t--)
    {
        ll n , ans = 1;
        scanf("%lld" , &n);
        for(int i = 1 ; i <= n ; i++)
            ans *= i ;
        printf("%.2lf%%\n" , (double)a[n]/ans*100);
    }

    return 0;
}