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 a_{i} (1 ≤ a_{i} ≤ 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 $\frac{|a - b|}{\operatorname{max}(1, b)} \leq 10^{-6}$.


-----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 $\frac{1}{3} \cdot \frac{1}{3} \cdot \frac{2}{3} = \frac{2}{27}$.

Source: codeforces | Difficulty: MEDIUM_HARD
Tags: Dynamic programming

Combinatorics

Complete search

Probability


Solutions:
MAX_N = 5001
a = [0] * MAX_N
raz = [0] * (MAX_N + 10)
s = [0] * (MAX_N + 10)
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
	for j in range(n):
		if a[i] - a[j] > 0:
			raz[a[i] - a[j]] += 1
for i in range(1, MAX_N + 1):
	s[i] = s[i - 1] + raz[i]
ans = 0
for i in range(1, MAX_N):
	if raz[i] == 0:
		continue
	for j in range(1, MAX_N):
		if i + j > MAX_N:
			break
		if raz[j] == 0:
			continue
		ans += raz[i] * raz[j] * (s[MAX_N] - s[i + j])
ans = ans * 1.0
ans /= s[MAX_N]
ans /= s[MAX_N]
ans /= s[MAX_N]
print(ans)


from itertools import accumulate
n = int(input())
A = [int(x) for x in input().split()]
m = max(A)
difference = [0 for i in range(m)]
for i in range(n):
	for j in range(i + 1, n):
		difference[abs(A[i] - A[j])] += 1
diffsum = [0 for i in range(2 * m)]
for i in range(m):
	for j in range(m):
		diffsum[i + j] += difference[i] * difference[j]
D = list(accumulate(diffsum))
ans = sum((difference[k] * D[k - 1] for k in range(m)))
print(8 * ans / (n * (n - 1)) ** 3)


def main():
	n = int(input())
	a = list(map(int, input().split()))
	max_element = max(a) + 1
	diff_freq = [0 for i in range(max_element)]
	for i in range(n):
		for j in range(i):
			diff_freq[abs(a[i] - a[j])] += 1
	largest = [0 for i in range(max_element)]
	for i in range(max_element - 2, 0, -1):
		largest[i] = largest[i + 1] + diff_freq[i + 1]
	good_ones = 0
	for i in range(max_element):
		for j in range(max_element):
			if i + j < max_element:
				good_ones += diff_freq[i] * diff_freq[j] * largest[i + j]
	ans = good_ones / (n * (n - 1) / 2) ** 3
	print(ans)
main()


n = int(input())
t = sorted(map(int, input().split()))
m = 5001
d = [0, 0] * m
for a in t:
	for b in t:
		d[b - a] += 1
for i in range(m, 2 * m):
	d[i] = d[i - 1] + d[i]
s = 0
for i in range(1, m):
	s += d[i] * sum((d[j] * d[-1 - i - j] for j in range(1, m - i)))
print(8 * s / (n * n - n) ** 3)


from itertools import accumulate
R = lambda : map(int, input().split())
n = int(input())
arr = sorted(R())
ones = [0] * 5005
for i in range(n):
	for j in range(i):
		ones[abs(arr[i] - arr[j])] += 1
twos = [0] * 10005
for i in range(1, 5001):
	for j in range(1, 5001):
		if ones[i] and ones[j]:
			twos[i + j] += ones[i] * ones[j]
stwos = list(accumulate(twos))
(sat, sm) = (0, 0)
for i in range(1, 5001):
	if ones[i]:
		sat += ones[i] * stwos[i - 1]
		sm += ones[i] * stwos[-1]
print(sat / max(1, sm))


import sys
n = int(sys.stdin.readline())
a = [int(s) for s in sys.stdin.readline().split()]
a.sort()
diffs1 = []
for i in range(5000):
	diffs1.append(0)
for i in range(n):
	for j in range(i + 1, n):
		diffs1[a[j] - a[i]] += 1
diffs2 = []
for i in range(10000):
	diffs2.append(0)
for i in range(len(diffs1)):
	for j in range(i, len(diffs1)):
		if i == j:
			diffs2[i + j] += diffs1[i] * diffs1[j]
		else:
			diffs2[i + j] += 2 * diffs1[i] * diffs1[j]
for i in range(1, len(diffs2)):
	diffs2[i] += diffs2[i - 1]
good = 0
for u in range(n - 1, 0, -1):
	for t in range(u - 1, -1, -1):
		good += diffs2[a[u] - a[t] - 1]
all = n * (n - 1) // 2
all = all * all * all
print(float(good) / float(all))


ways = [0] * 5001
s_ways = [0] * 5001
n = int(input())
a = set(map(int, input().split()))
for diff in range(4999, 0, -1):
	for i in a:
		if i >= diff and i - diff in a:
			ways[diff] += 1
	ways[diff] /= n * (n - 1) / 2
	s_ways[diff] = s_ways[diff + 1] + ways[diff]
ans = 0
for diff1 in range(1, 5000):
	for diff2 in range(1, 5000 - diff1):
		targetdiff = diff1 + diff2 + 1
		ans += ways[diff1] * ways[diff2] * s_ways[targetdiff]
print(ans)