#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define ull unsigned long long 
#define sz(a) ((int) a.size())
#define vi vector<int>
#define me(a, x) memset(a, x, sizeof(a))
using namespace std;
const int N = 1 << 21, L = 5e5, mod = 998244353;

double f[N];

ll n;

int k;
ll a[N], b[N];
ll rd() {
	cin >> k;
	L(i, 1, k) {
		cin >> a[i] >> b[i];
	}
	n = 0;
	while(true) {
		int win = 1;
		L(i, 1, k) {
			if(n % b[i] != a[i]) {
				win = 0;
				break;
			}
		}
		if(win) break;
		++n;
		if(n > 200) {
			n = 0;
			break;
		}
	}
	return n;
}

int main () { 
	ios :: sync_with_stdio(false);
	cin.tie (0); cout.tie (0);
	n = rd();
	if(n < 2) {
		cout << "error\n";
		return 0;
	}
	L(i, 1, n) {
		f[i] = 1;
	}
	R(t, n, 3) {
		sort(f + 2, f + t + 1);
		reverse(f + 2, f + t + 1);
		double sum1 = 0, sum2 = 0;
		L(i, 2, t - 1) 
			sum1 += f[i];
		sum2 = sum1 + f[t];
		L(i, 2, t - 1) 
			f[i] *= sum2 / sum1;
		sort(f + 1, f + t + 1);
		reverse(f + 1, f + t + 1);
	}
	cout.precision(6); cout << fixed;
	cout << max(f[1], f[2]) / n << '\n';
	return 0;
}

/*
(n-1)/(n-2) 1 [(n-1)/(n-2)] (n-1)/(n-2) (n-1)/(n-2) x 
*/