Problem: Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly without replacement from a jar containing n balls, each labeled with a distinct positive integer. Without looking, they hand their balls to Harry, who awards the point to the player with the larger number and returns the balls to the jar. The winner of the game is the one who wins at least two of the three rounds.

Andrew wins rounds 1 and 2 while Jerry wins round 3, so Andrew wins the game. However, Jerry is unhappy with this system, claiming that he will often lose the match despite having the higher overall total. What is the probability that the sum of the three balls Jerry drew is strictly higher than the sum of the three balls Andrew drew?

Input

The first line of input contains a single integer n (2 ≤ n ≤ 2000) — the number of balls in the jar.

The second line contains n integers ai (1 ≤ ai ≤ 5000) — the number written on the ith ball. It is guaranteed that no two balls have the same number.

Output

Print a single real value — the probability that Jerry has a higher total, given that Andrew wins the first two rounds and Jerry wins the third. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6. 

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.

Examples

Input

2
1 2


Output

0.0000000000


Input

3
1 2 10


Output

0.0740740741

Note

In the first case, there are only two balls. In the first two rounds, Andrew must have drawn the 2 and Jerry must have drawn the 1, and vice versa in the final round. Thus, Andrew's sum is 5 and Jerry's sum is 4, so Jerry never has a higher total.

In the second case, each game could've had three outcomes — 10 - 2, 10 - 1, or 2 - 1. Jerry has a higher total if and only if Andrew won 2 - 1 in both of the first two rounds, and Jerry drew the 10 in the last round. This has probability <image>.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class JerrysProtest {
	
	static final int MAX = 5007;
	
	public static void main(String[] args) {
		InputReader in = new InputReader(System.in);
		
		int n = in.nextInt();
		int[] a = new int[n];
		
		for (int i = 0; i < n; ++i) {
			a[i] = in.nextInt();
		}
		
		// The constraints are:
		// (a1-j1)>0, (a2-j2)>0, (j3-a3)>0, j1+j2+j3>a1+a2+a3
		// => (a1-j1) + (a2-j2) < (j3-a3)
		// In the end, what matters is the differences that are > 0
		//
		// So, the problem boils down to:
		// d1 + d2 < d3, where di > 0 (1)
		//
		// the probability is X/Y, where:
		// Y = number of di > 0, cubed: (n(n-1)/2)^3
		// X = number of d3, such that (1) holds
		
		// 0 < di < 5000
		// => 0 < d1+d2 < 10000
		// keep a count on the frequency of each d1+d2
		
		Arrays.sort(a);
		long[] f = new long[MAX];
		
		for (int i = 0; i < n; ++i)
			for (int j = i + 1; j < n; ++j) {
				int d = a[j] - a[i];
				
				assert d > 0 && d < MAX;
				++f[d];
			}
		
		double[] p = new double[2 * MAX];
		for (int d1 = 1; d1 < MAX; ++d1)
			for (int d2 = 1; d2 < MAX; ++d2)
				p[d1 + d2] += (double) f[d1] * f[d2];
		
		// accumulate frequencies
		for (int i = 1; i < p.length; ++i)
			p[i] += p[i - 1];
		
		// count how many pairs satisfy (1)
		double prob = 0;
		for (int i = 0; i < n; ++i)
			for (int j = i + 1; j < n; ++j) {
				int d3 = a[j] - a[i];				
				prob += (double) p[d3 - 1];
			}
		
		int numPairs = n * (n - 1) / 2;
		for (int i = 0; i < 3; ++i) prob /= (double) numPairs;
		
		System.out.printf("%.10f\n", prob);
		
		System.exit(0);
	}
	

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = new StringTokenizer("");
		}

		public String next() {
			try {
				while (!tokenizer.hasMoreTokens())
					tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
			
			return tokenizer.nextToken();
		}
		
		public String nextLine() {
			String line = null;
			try {
				tokenizer = new StringTokenizer("");
				line =  reader.readLine();
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
			return line;
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}
		
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		
		public long nextLong() {
			return Long.parseLong(next());
		}
		
		boolean hasNext() {
            while (!tokenizer.hasMoreTokens()) {
                String line = nextLine();
                if (line == null) return false;
                tokenizer = new StringTokenizer(line);
            }
            return true;
        }
	}
}