Problem: You play the game with your friend. The description of this game is listed below. 

Your friend creates n distinct strings of the same length m and tells you all the strings. Then he randomly chooses one of them. He chooses strings equiprobably, i.e. the probability of choosing each of the n strings equals <image>. You want to guess which string was chosen by your friend. 

In order to guess what string your friend has chosen, you are allowed to ask him questions. Each question has the following form: «What character stands on position pos in the string you have chosen?» A string is considered guessed when the answers to the given questions uniquely identify the string. After the string is guessed, you stop asking questions. 

You do not have a particular strategy, so as each question you equiprobably ask about a position that hasn't been yet mentioned. Your task is to determine the expected number of questions needed to guess the string chosen by your friend.

Input

The first line contains a single integer n (1 ≤ n ≤ 50) — the number of strings your friend came up with.

The next n lines contain the strings that your friend has created. It is guaranteed that all the strings are distinct and only consist of large and small English letters. Besides, the lengths of all strings are the same and are between 1 to 20 inclusive.

Output

Print the single number — the expected value. Your answer will be considered correct if its absolute or relative error doesn't exceed 10 - 9.

Examples

Input

2
aab
aac


Output

2.000000000000000


Input

3
aaA
aBa
Caa


Output

1.666666666666667


Input

3
aca
vac
wqq


Output

1.000000000000000

Note

In the first sample the strings only differ in the character in the third position. So only the following situations are possible: 

  * you guess the string in one question. The event's probability is <image>; 
  * you guess the string in two questions. The event's probability is <image> · <image> = <image> (as in this case the first question should ask about the position that is other than the third one); 
  * you guess the string in three questions. The event's probability is <image> · <image> · <image> = <image>; 



Thus, the expected value is equal to <image>

In the second sample we need at most two questions as any pair of questions uniquely identifies the string. So the expected number of questions is <image>.

In the third sample whatever position we ask about in the first question, we immediately identify the string.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int cache_bits = 20;
const int cache_mask = (1 << cache_bits) - 1;
vector<long long> count_cache;
int count(long long x) {
  int s = 0;
  while (x) {
    s += count_cache[x & cache_mask];
    x >>= cache_bits;
  }
  return s;
}
void build_count_cache() {
  count_cache.resize(1 << cache_bits);
  for (int i = (1); i < (int)(count_cache.size()); i++)
    count_cache[i] = count_cache[i & (i - 1)] + 1;
}
void solve() {
  build_count_cache();
  int n;
  cin >> n;
  vector<string> S(n);
  for (int(i) = 0; (i) < (n); (i)++) cin >> S[i];
  int m = S[0].size();
  vector<long long> mask_array(1 << m);
  for (int(i) = 0; (i) < (n); (i)++) {
    for (int j = (i + 1); j < (int)(n); j++) {
      long long s = 0;
      for (int(k) = 0; (k) < (m); (k)++)
        if (S[i][k] == S[j][k]) s |= (1 << k);
      mask_array[s] |= (1LL << i) | (1LL << j);
    }
  }
  for (int i = mask_array.size() - 1; i; --i) {
    if (!mask_array[i]) {
      continue;
    }
    for (int(bit_idx) = 0; (bit_idx) < (m); (bit_idx)++) {
      long long bit = (1 << bit_idx);
      if (bit & i) {
        mask_array[i ^ bit] |= mask_array[i];
      }
    }
  }
  vector<double> subset_probs(m, 1.);
  for (int k = (0); k < (int)(subset_probs.size()); k++) {
    for (int(i) = 0; (i) < (k); (i)++) {
      subset_probs[k] *= double(k - i) / (m - i);
    }
    subset_probs[k] /= (m - k);
  }
  vector<double> cnt_per_attemp(m);
  for (int i = 0; i < (int)(mask_array).size(); i++) {
    if (!mask_array[i]) {
      continue;
    }
    int attemps = count(i);
    int unk_before = count(mask_array[i]);
    for (int(bit_idx) = 0; (bit_idx) < (m); (bit_idx)++) {
      long long bit = 1 << bit_idx;
      if ((bit & i) == 0) {
        long long unk_after_mask = mask_array[i] & mask_array[(i | bit)];
        int unk_after = count(unk_after_mask);
        cnt_per_attemp[attemps] += (unk_before - unk_after);
      }
    }
  }
  double mexp = 0;
  for (int(i) = 0; (i) < (m); (i)++)
    mexp += (i + 1) * subset_probs[i] * cnt_per_attemp[i] / n;
  cout.precision(15);
  cout << mexp;
}
int main() {
  solve();
  return 0;
}