Problem: Nowadays, most of the internet advertisements are not statically linked to a web page. Instead, what will be shown to the person opening a web page is determined within 100 milliseconds after the web page is opened. Usually, multiple companies compete for each ad slot on the web page in an auction. Each of them receives a request with details about the user, web page and ad slot and they have to respond within those 100 milliseconds with a bid they would pay for putting an advertisement on that ad slot. The company that suggests the highest bid wins the auction and gets to place its advertisement. If there are several companies tied for the highest bid, the winner gets picked at random.

However, the company that won the auction does not have to pay the exact amount of its bid. In most of the cases, a second-price auction is used. This means that the amount paid by the company is equal to the maximum of all the other bids placed for this ad slot.

Let's consider one such bidding. There are n companies competing for placing an ad. The i-th of these companies will bid an integer number of microdollars equiprobably randomly chosen from the range between Li and Ri, inclusive. In the other words, the value of the i-th company bid can be any integer from the range [Li, Ri] with the same probability. 

Determine the expected value that the winner will have to pay in a second-price auction.

Input

The first line of input contains an integer number n (2 ≤ n ≤ 5). n lines follow, the i-th of them containing two numbers Li and Ri (1 ≤ Li ≤ Ri ≤ 10000) describing the i-th company's bid preferences.

This problem doesn't have subproblems. You will get 8 points for the correct submission.

Output

Output the answer with absolute or relative error no more than 1e - 9.

Examples

Input

3
4 7
8 10
5 5


Output

5.7500000000


Input

3
2 5
3 4
1 6


Output

3.5000000000

Note

Consider the first example. The first company bids a random integer number of microdollars in range [4, 7]; the second company bids between 8 and 10, and the third company bids 5 microdollars. The second company will win regardless of the exact value it bids, however the price it will pay depends on the value of first company's bid. With probability 0.5 the first company will bid at most 5 microdollars, and the second-highest price of the whole auction will be 5. With probability 0.25 it will bid 6 microdollars, and with probability 0.25 it will bid 7 microdollars. Thus, the expected value the second company will have to pay is 0.5·5 + 0.25·6 + 0.25·7 = 5.75.

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;

import javax.swing.text.IconView;

public class Rocketthon2015_C {

	/**
	 * @param args
	 */
	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);

		int n = in.nextInt();

		int[] L = new int[n];
		int[] R = new int[n];
		for (int i = 0; i < n; i++) {
			L[i] = in.nextInt();
			R[i] = in.nextInt();
		}

		int max = 10000; // FIXME

		// Find the probability of each company winning
		double pReach = 1.0;
		double[] pWin = new double[max + 1];
		int[] L_temp = Arrays.copyOf(L, L.length);
		int[] R_temp = Arrays.copyOf(R, R.length);
		for (int winningBid = max; winningBid >= 1; winningBid--) {

			for (int iComp = 0; iComp < n; iComp++) {
				R_temp[iComp] = Math.min(R_temp[iComp], winningBid);
			}

			double pWinHappens = 0;
			double pWinConfig = 1;

			for (int iComp = 0; iComp < n; iComp++) {

				if (winningBid <= R_temp[iComp]) {
					int nBids = R_temp[iComp] - L_temp[iComp] + 1;
					double pBid = ((double) nBids - 1) / nBids;
					pWinConfig *= pBid;
				}

			}

			pWinHappens = 1 - pWinConfig;

			pWin[winningBid] = pReach * pWinHappens;

			pReach = pReach * (1 - pWinHappens);
			if (pReach == 0) {
				break;
			}
		}

		double[][] eValMissing = new double[n][max + 1];
		double[][] pWinMissing = new double[n][max + 1];
		for (int iMissing = 0; iMissing < n; iMissing++) {
			L_temp = Arrays.copyOf(L, L.length);
			R_temp = Arrays.copyOf(R, R.length);
			pReach = 1.0;
			for (int winningBid = max; winningBid >= 1; winningBid--) {

				for (int iComp = 0; iComp < n; iComp++) {
					R_temp[iComp] = Math.min(R_temp[iComp], winningBid);
				}

				double pWinHappens = 0;
				double pWinConfig = 1;

				for (int iComp = 0; iComp < n; iComp++) {

					if (iComp == iMissing) {
						continue;
					}

					if (winningBid <= R_temp[iComp]) {
						int nBids = R_temp[iComp] - L_temp[iComp] + 1;
						double pBid = ((double) nBids - 1) / nBids;
						pWinConfig *= pBid;
					}

				}

				pWinHappens = 1 - pWinConfig;

				pWinMissing[iMissing][winningBid] = pReach * pWinHappens;

				pReach = pReach * (1 - pWinHappens);
				if (pReach == 0) {
					break;
				}
			}
		}

		for (int iMissing = 0; iMissing < n; iMissing++) {

			int smallestWinner = -1;
			for (int winningBid = 1; winningBid <= max; winningBid++) {
				if (pWinMissing[iMissing][winningBid] > 0) {
					smallestWinner = winningBid;
					break;
				}
			}

			double pSum = pWinMissing[iMissing][smallestWinner];
			eValMissing[iMissing][smallestWinner] = smallestWinner;

			for (int winningBid = smallestWinner + 1; winningBid <= max; winningBid++) {

				eValMissing[iMissing][winningBid] = (pWinMissing[iMissing][winningBid]
						* winningBid + pSum
						* eValMissing[iMissing][winningBid - 1])
						/ (pWinMissing[iMissing][winningBid] + pSum);

				pSum += pWinMissing[iMissing][winningBid];

			}
		}

		double eVal = 0;

		for (int winningBid = 1; winningBid <= max; winningBid++) {

			if (pWin[winningBid] == 0) {
				continue;
			}

			double pUniqueWin = 0;
			for (int iWinComp = 0; iWinComp < n; iWinComp++) {

				if (winningBid < L[iWinComp] || winningBid > R[iWinComp]) {
					continue;
				}

				double pThisUniqueGivenThis = 1;
				for (int iComp = 0; iComp < n; iComp++) {

					int Li = L[iComp];
					int Ri = Math.min(R[iComp], winningBid);

					if (iComp != iWinComp) {
						if (Li >= winningBid) {
							pThisUniqueGivenThis = 0;
						} else if (Ri < winningBid) {
						} else {
							int nBids = Ri - Li + 1;
							pThisUniqueGivenThis *= (nBids - 1)
									/ ((double) nBids);
						}
					}

				}

				double pThisUniqueJoint = 1;
				for (int iComp = 0; iComp < n; iComp++) {
					if (iComp == iWinComp) {
						if (winningBid < L[iComp] || winningBid > R[iComp]) {
							pThisUniqueJoint = 0;
						} else {
							int nBids = R[iComp] - L[iComp] + 1;
							pThisUniqueJoint *= 1 / ((double) nBids);
						}
					} else {
						int nBids = R[iComp] - L[iComp] + 1;
						int nBidsLess = Math.max(0,
								Math.min(R[iComp], winningBid-1) - L[iComp] + 1);
						pThisUniqueJoint *= nBidsLess / ((double) nBids);
					}
				}
				
				pUniqueWin += pThisUniqueJoint / pWin[winningBid];

				eVal += pThisUniqueJoint
						* eValMissing[iWinComp][winningBid - 1];
			}

			eVal += pWin[winningBid] * (1 - pUniqueWin) * winningBid;
		}

		System.out.println(eVal);

	}
}