#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 sum,int kai){
	if (sum <= 0){
		countt++;
		m += kai;
		return;
	}
	for (int j = 1; j <= 6; j++){
		dfs(sum - j, kai+1);
	}
	return;
}
int main(){
	scanf("%d", &t);
	while (t--){
		m = 0;
		countt = 0;
		scanf("%d", &n);
		dfs(n,0);
		double ans = (double)m / (double)countt;
		printf("%.7f\n", ans);
	}
	return 0;
}