#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
using namespace std;
int t;
int n;
long long int countt = 0;
long long int m;
void dfs(int j,int sum,int kai){
	if (j == 6){
		if ((n-sum) % 6 == 0){
			countt++;
			m+=kai+((n-sum)/6);
		}
		return;
	}
	else{
		for (int k = 0; j*k + sum <= n; k++){
			dfs(j + 1, sum + j*k, kai+k);
		}
		return;
	}
}
int main(){
	scanf("%d", &t);
	while (t--){
		m = 0;
		countt = 0;
		scanf("%d", &n);
		dfs(1, 0,0);
		double ans = (double)m / (double)countt;
		printf("%.7f\n", ans);
	}
	return 0;
}