#include<cstdio>
#define TY int
#define MAXN 200002
#define FOR(i,a,b) for(TY i=(a);i<=(b);i=-~i)
#define fOR(i,a,b) for(TY i=(a);i<(b);i=-~i)
#define ROF(i,a,b) for(TY i=(a);i>=(b);i=~-i)
#define rOF(i,a,b) for(TY i=(a);i>(b);i=~-i)
#define EDG(i,u) for(TY i=hed[u];i;i=nxt[i])
using namespace std;
typedef long long ll;
const TY M=998244353;
typedef long double db;
typedef unsigned long long ull;
TY _abs(TY a){return a<0?-a:a;}
TY maxn(TY a,TY b){return a>b?a:b;}
TY minn(TY a,TY b){return a<b?a:b;}
inline void updmx(TY &x,TY y){if(x<y)x=y;}
inline void updmn(TY &x,TY y){if(x>y)x=y;}
inline void add(TY &x,TY y){if((x+=y)>=M)x-=M;}
TY gcd(TY a,TY b){return b?gcd(b,a%b):a;}
TY qp(TY a,TY b){TY ans=1;do{if(1&b)ans=ans*a%M;a=a*a%M;}while(b>>=1);return ans;}
char getc(){char ch=getchar();while(ch==' '||ch=='\n'||ch=='\r')ch=getchar();return ch;}
TY qr(){
	char ch=getchar();TY s=0,x=1;
	for(;ch<'0'||ch>'9';ch=getchar())if(ch=='-')x=-1;
	for(;ch>='0'&&ch<='9';ch=getchar())s=s*10+ch-'0';return x*s;
}void qw(TY a){if(a>9)qw(a/10);putchar(a%10+'0');}
void qw(TY a,char ch){
	if(a<0){a=-a;putchar('-');}
	if(a>9)qw(a/10);putchar(a%10+'0');if(ch)putchar(ch);
}TY lg[MAXN],T=qr(),n,rk[MAXN<<1],sa[MAXN],w[MAXN],t[MAXN],A[MAXN],x,y,ST[18][MAXN];char s[MAXN];
db findans(TY l,TY r){
	if(l==r)return n-sa[l]+1;
	TY k=lg[r-l],p=ST[k][r-(1<<k)];
	if(w[p]>w[ST[k][l]])p=ST[k][l];
	db x=findans(l,p)-w[p],y=findans(p+1,r)-w[p];
	if(x+y<1e-6)return w[p];
	return x*y/(x+y)+w[p];
}int main(){
	fOR(i,2,MAXN)lg[i]=lg[i>>1]+1;
	while(T--){
		scanf("%s",s+1);
		for(n=0;s[n+1];++n);
		fOR(i,0,26)t[i]=0;
		FOR(i,1,n)t[s[i]-'a']=1;
		fOR(i,y=0,26)if(t[i])t[i]=++y;
		FOR(i,1,n)rk[i]=t[s[i]-'a'];
		FOR(i,1,n)rk[n+i]=0;
		for(TY x=1;x<n;x<<=1){
			FOR(i,0,n)t[i]=0;
			FOR(i,1,n)++t[rk[i+x]];
			FOR(i,1,n)t[i]+=t[i-1];
			FOR(i,1,n)A[t[rk[i+x]]--]=i;
			FOR(i,1,n)t[i]=0;FOR(i,1,n)++t[rk[i]];
			FOR(i,1,n)t[i]+=t[i-1];
			ROF(i,n,1)sa[t[rk[A[i]]]--]=A[i];
			y=1;FOR(i,1,n){
				A[sa[i]]=y;if(i==n)break;
				if(rk[sa[i]]!=rk[sa[i+1]]||rk[sa[i]+x]!=rk[sa[i+1]+x])++y;
			}FOR(i,1,n)rk[i]=A[i];if(y==n)break;
		}x=0;sa[n+1]=n+1;FOR(i,1,n){
			y=sa[rk[i]+1];if(x)--x;
			while(i+x<=n&&y+x<=n&&s[i+x]==s[y+x])++x;
			w[rk[i]]=x;
		}fOR(i,1,n)ST[0][i]=i;
		fOR(i,0,lg[n])ROF(j,n-(1<<i+1),1){
			ST[i+1][j]=ST[i][j+(1<<i)];
			if(w[ST[i+1][j]]>w[ST[i][j]])ST[i+1][j]=ST[i][j];
		}printf("%.10Lf\n",findans(1,n));
	}return 0;
}