#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
// #define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
#define N 1000005
using namespace std;
ll x, y, d; int n;

void exgcd(ll &x, ll &y, ll a, ll b) {
    if(!b) d = a, x = 1, y = 0;
    else exgcd(y, x, b, a % b), y -= a / b * x;
}

ll gcd(ll a, ll b) {
    return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll a, b, A, B;

map<vector<pa>,double>dp;
double dfs(vector<pa> g)
{
    if (g.size()==2) return g.back().se;
    if (dp.count(g)) return dp[g];
    int len=g.size()-1;
    double res=inf;
    for (int i=0;i+1<g.size();i++)
        if (g[i].se!=1)
        {
            int nw=g[i].fi;
            vector<pa> nxt;
            for (int j=0;j+1<g.size();j++)
            {
                if (j!=i)
                    nxt.push_back(mp(nw/(g.size()-2)+g[j].fi,g[j].se));
            }
            nxt.push_back(g.back());
            sort(nxt.begin(),nxt.end());
            int tot=0;
            double sm=0;
            for (int k=0;k<nxt.size();k++)
            {
                if (nxt[k].fi==nxt.back().fi) tot++;
            }
            sm+=dfs(nxt);
            if (tot!=1)
            {
                swap(nxt.back(),nxt[nxt.size()-2]);
                sm+=dfs(nxt)*(tot-1);
            }
            sm/=tot;
            res=min(res,sm);
        }
    return dp[g]=res;
}
void merge()
{
    exgcd(x, y, a, A);
    ll c = B - b;
    if(c % d)
    {
        cout<<"error"<<endl;
        exit(0);
    }
    x = x * c / d % (A / d);
    if(x < 0) x += A / d;
    ll mod = lcm(a, A);
    b = (a * x + b) % mod; if(b < 0) b += mod;
    a = mod;
}
void BellaKira()
{
    int t;
    cin>>t;
    for(int i = 1 ; i <= t ; ++ i)
    {
        long long _A, _B;
        cin>>_B>>_A;
        A = _A, B = _B;
        if(i > 1) merge();
        else a = A, b = B;
    }
    int n=b%a;
    if (n==0) n+=a;
    if (n>10)
    {
        cout<<0.000000<<'\n';
        return;
    }
    // cout<<"!"<<n<<endl;
    int x=1;
    for (int i=1;i<=n;i++) x=x*i;
    vector<pa> g;
    for (int i=1;i<n;i++)
        g.push_back(mp(x,0));
    g.push_back(mp(x,1));
    double ans=dfs(g);
    swap(g.back(),g[g.size()-2]);
    ans+=(n-1)*dfs(g);
    cout<<fixed<<setprecision(6)<<ans/n<<endl;
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}