#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 7;
double P[107][107], Num[N], L[N], R[N], Dp[N];
int Cnt, n;
int main() {
  scanf("%d", &n);
  for (int i = (1), iLimit = (n); i <= iLimit; (++(i))) {
    scanf("%lf%lf", L + i, R + i);
    Num[(++(Cnt))] = L[i], Num[(++(Cnt))] = R[i];
  }
  sort(Num + 1, Num + 1 + Cnt);
  Cnt = unique(Num + 1, Num + 1 + Cnt) - Num - 1;
  for (int i = (1), iLimit = (n); i <= iLimit; (++(i))) {
    for (int j = (0), jLimit = (n); j <= jLimit; (++(j))) Dp[j] = 0;
    for (int Now = (1), NowLimit = (Cnt - 1); Now <= NowLimit; (++(Now))) {
      double l = Num[Now], r = Num[Now + 1];
      if (r <= L[i] || l >= R[i]) continue;
      int Sum = 0, ll = 0, rr = 0;
      for (int j = (0), jLimit = (n); j <= jLimit; (++(j)))
        for (int k = (0), kLimit = (n); k <= kLimit; (++(k))) P[j][k] = 0;
      P[0][0] = (r - l) / (R[i] - L[i]);
      for (int p = (1), pLimit = (n); p <= pLimit; (++(p)))
        if (p != i) {
          if (R[p] <= l) {
            (++(ll));
            continue;
          }
          if (L[p] >= r) {
            (++(rr));
            continue;
          }
          double Pm = (r - l) / (R[p] - L[p]);
          double Pl = max(l - L[p], 0.0) / (R[p] - L[p]),
                 Pr = max(R[p] - r, 0.0) / (R[p] - L[p]);
          (++(Sum));
          for (int j = (Sum), jLimit = (0); j >= jLimit; (--(j)))
            for (int k = (Sum), kLimit = (0); k >= kLimit; (--(k))) {
              P[j][k] *= Pm;
              if (j) P[j][k] += P[j - 1][k] * Pl;
              if (k) P[j][k] += P[j][k - 1] * Pr;
            }
        }
      for (int j = (ll), jLimit = (n - 1); j <= jLimit; (++(j)))
        for (int k = (rr), kLimit = (n - j - 1); k <= kLimit; (++(k))) {
          Dp[j + 1] += P[j - ll][k - rr] / (n - j - k);
          Dp[n - k + 1] -= P[j - ll][k - rr] / (n - j - k);
        }
    }
    for (int j = (1), jLimit = (n); j <= jLimit; (++(j))) Dp[j] += Dp[j - 1];
    for (int j = (1), jLimit = (n); j <= jLimit; (++(j)))
      printf("%.10f ", Dp[j]);
    puts("");
  }
  return 0;
}
