using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		N = S.Length;
		double ret = 0;
		for(int len=1;len<=26;len++){
			var dl = new Dictionary<char, int>();
			int l = 0;
			var dr = new Dictionary<char, int>();
			int r = 0;
			double cnt = 0;
			for(int i=0;i<N;i++){
				if(l < i) l = i;
				if(r < i) r = i;
				while(l < N){
					if(dl.ContainsKey(S[l])){
						dl[S[l]]++;
						l++;
						continue;
					}
					if(dl.Count < len - 1){
						dl.Add(S[l], 1);
						l++;
						continue;
					}
					break;
				}
				while(r < N){
					if(dr.ContainsKey(S[r])){
						dr[S[r]]++;
						r++;
						continue;
					}
					if(dr.Count < len){
						dr.Add(S[r], 1);
						r++;
						continue;
					}
					break;
				}
				if(dr.Count == len){
					cnt += r - l;
				}
				if(dl.ContainsKey(S[i])){
					dl[S[i]]--;
					if(dl[S[i]] == 0) dl.Remove(S[i]);
				}
				if(dr.ContainsKey(S[i])){
					dr[S[i]]--;
					if(dr[S[i]] == 0) dr.Remove(S[i]);
				}
			}
			//Console.WriteLine("len:{0}, cnt:{1}",len, cnt);
			
			double tot = (double) N * (double) (N + 1) / 2.0;
			double ret0 = (double) len * cnt / tot;
		
			ret += ret0;
		}
		Console.WriteLine(ret);
	}
	
	double calc(int len){
		var dl = new Dictionary<char, int>();
		int l = 0;
		var dr = new Dictionary<char, int>();
		int r = 0;
		double cnt = 0;
		for(int i=0;i<N;i++){
			if(l < i) l = i;
			if(r < i) r = i;
			while(l < N){
				if(dl.ContainsKey(S[l])){
					dl[S[l]]++;
					l++;
					continue;
				}
				if(dl.Count < len - 1){
					dl.Add(S[l], 1);
					l++;
					continue;
				}
				break;
			}
			while(r < N){
				if(dr.ContainsKey(S[r])){
					dr[S[r]]++;
					r++;
					continue;
				}
				if(dr.Count < len){
					dr.Add(S[r], 1);
					r++;
					continue;
				}
				break;
			}
			if(dr.Count == len){
				cnt += r - l;
			}
			if(dl.ContainsKey(S[i])){
				dl[S[i]]--;
				if(dl[S[i]] == 0) dl.Remove(S[i]);
			}
			if(dr.ContainsKey(S[i])){
				dr[S[i]]--;
				if(dr[S[i]] == 0) dr.Remove(S[i]);
			}
		}
		//Console.WriteLine("len:{0}, cnt:{1}",len, cnt);
		
		double tot = (double) N * (double) (N + 1) / 2.0;
		return (double) len * cnt / tot;
		
	}
	
	
	
	
	int N;
	String S;
	public Sol(){
		S = rs();
		
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}